Succinct Data Structures for Chordal Graphs
dc.contributor.author | Wu, Kaiyu | |
dc.date.accessioned | 2019-04-10T19:53:54Z | |
dc.date.available | 2019-04-10T19:53:54Z | |
dc.date.issued | 2019-04-10 | |
dc.date.submitted | 2019-04-04 | |
dc.description.abstract | We study the problem of approximate shortest path queries in chordal graphs and give a n log n + o(n log n) bit data structure to answer the approximate distance query to within an additive constant of 1 in O(1) time. We study the problem of succinctly storing a static chordal graph to answer adjacency, degree, neighbourhood and shortest path queries. Let G be a chordal graph with n vertices. We design a data structure using the information theoretic minimal n^2/4 + o(n^2) bits of space to support the queries: whether two vertices u,v are adjacent in time f(n) for any f(n) \in \omega(1). the degree of a vertex in O(1) time. the vertices adjacent to u in O(f(n)^2) time per neighbour the length of the shortest path from u to v in O(n f(n)) time | en |
dc.identifier.uri | http://hdl.handle.net/10012/14520 | |
dc.language.iso | en | en |
dc.pending | false | |
dc.publisher | University of Waterloo | en |
dc.title | Succinct Data Structures for Chordal Graphs | en |
dc.type | Master Thesis | en |
uws-etd.degree | Master of Mathematics | en |
uws-etd.degree.department | David R. Cheriton School of Computer Science | en |
uws-etd.degree.discipline | Computer Science | en |
uws-etd.degree.grantor | University of Waterloo | en |
uws.contributor.advisor | Munro, J. Ian | |
uws.contributor.affiliation1 | Faculty of Mathematics | en |
uws.peerReviewStatus | Unreviewed | en |
uws.published.city | Waterloo | en |
uws.published.country | Canada | en |
uws.published.province | Ontario | en |
uws.scholarLevel | Graduate | en |
uws.typeOfResource | Text | en |