A small universal graph for bounded-degree planar graphs

Authors:
M. R. Capalbo
Affiliations:
Department of Mathematical Sciences, The Johns Hopkins University, 3400 N. Charles Street, Baltimore, MD
Venue:
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Year:
1999

Small universal graphs

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Near-optimum Universal Graphs for Graphs with Bounded Degrees

APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Sparse universal graphs for bounded-degree graphs

Random Structures & Algorithms
Optimal universal graphs with deterministic embedding

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On randomized representations of graphs using short labels

Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures

Hi-index	0.00