Name
Abstract | ||
|---|---|---|
Given an unlabeled, unweighted, and undirected graph with n vertices and small (but not necessarily constant) treewidth k, we consider the problem of preprocessing the graph to build space-efficient encodings (oracles) to perform various queries efficiently. We assume the word RAM model where the size of a word is Ω (log n) bits. The first oracle, we present, is the navigation oracle which facilitates primitive navigation operations of adjacency, neighborhood, and degree queries. By way of an enumerate argument, which is of independent interest, we show the space requirement of the oracle is optimal to within lower order terms for all treewidths. The oracle supports the mentioned queries all in constant worst-case time. The second oracle, we present, is an exact distance oracle which facilitates distance queries between any pair of vertices (i.e., an all-pair shortest-path oracle). The space requirement of the oracle is also optimal to within lower order terms. Moreover, the distance queries perform in O(k2 log3 k) time. Particularly, for the class of graphs of our interest, graphs of bounded treewidth (where k is constant), the distances are reported in constant worst-case time. |
Year | DOI | Venue |
|---|---|---|
2014 | https://doi.org/10.1007/s00453-012-9712-9 | international colloquium on automata, languages and programming |
Keywords | DocType | Volume |
Graph decomposition,Treewidth,Navigation oracles,Distance oracles | Journal | 69 |
Issue | ISSN | Citations |
1 | 0178-4617 | 4 |
PageRank | References | Authors |
0.41 | 35 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Arash Farzan | 1 | 136 | 11.07 |
| Shahin Kamali | 2 | 112 | 15.41 |