Labeling schemes for small distances in trees
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Average case analysis for tree labelling schemes
Theoretical Computer Science
Note: A note on models for graph representations
Theoretical Computer Science
On randomized representations of graphs using short labels
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
An Optimal Labeling for Node Connectivity
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Labeling schemes for vertex connectivity
ACM Transactions on Algorithms (TALG)
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Shorter implicit representation for planar graphs and bounded treewidth graphs
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Distributed relationship schemes for trees
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
An optimal ancestry scheme and small universal posets
Proceedings of the forty-second ACM symposium on Theory of computing
Compact ancestry labeling schemes for XML trees
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
SIAM Journal on Computing
Labeling scheme and structural joins for graph-structured XML data
APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development
Short labels by traversal and jumping
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Subgraph join: efficient processing subgraph queries on graph-structured XML document
WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management
Average case analysis for tree labelling schemes
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Constructing labeling schemes through universal matrices
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Compact separator decompositions in dynamic trees and applications to labeling schemes
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Labeling schemes for vertex connectivity
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
We show that there exists a graph G with n \cdot 2^{0(\log* n)} nodes, where any forest with n nodes is a node-induced subgraph of G. Furthermore, the result implies existence of a graph with n^k 2^{0(\log* n)}nodes that contains all n-node graphs of fixed arboricity k as node-induced subgraphs. We provide a lower bound of \Omega (n^k) for the size of such a graph. The upper bound is obtained through a simple labeling scheme for parent queries in rooted trees.