Implicit representation of graphs
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Implicit representation of graphs
SIAM Journal on Discrete Mathematics
Compact labeling schemes for ancestor queries
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Small Induced-Universal Graphs and Compact Implicit Graph Representations
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Short and Simple Labels for Small Distances and Other Functions
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Compact and localized distributed data structures
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Labeling Schemes for Small Distances in Trees
SIAM Journal on Discrete Mathematics
Compact Labeling Scheme for Ancestor Queries
SIAM Journal on Computing
Proper minor-closed families are small
Journal of Combinatorial Theory Series B
Localized and compact data-structure for comparability graphs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
On compact and efficient routing in certain graph classes
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Engineering Tree Labeling Schemes: A Case Study on Least Common Ancestors
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Shorter implicit representation for planar graphs and bounded treewidth graphs
ESA'07 Proceedings of the 15th annual European conference on Algorithms
| Hi-index | 0.00 |
In this paper, we propose an efficient implicit representation of caterpillars and binary trees with n vertices. Our schemes, called Traversal & Jumping, assign to vertices of the tree distinct labels of log2n + O(1) bits, and support constant time adjacency queries between any two vertices by using only their labels. Moreover, all the labels can be constructed in O(n) time