Optimal Induced Universal Graphs and Adjacency Labeling for Trees
From MaRDI portal
Publication:4640278
DOI10.1145/3088513zbMath1426.68192arXiv1504.02306OpenAlexW1498990067MaRDI QIDQ4640278
Mathias Bæk Tejs Knudsen, Søren Dahlgaard, Stephen Alstrup
Publication date: 17 May 2018
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.02306
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Better distance labeling for unweighted planar graphs ⋮ Twin-width II: small classes ⋮ Adjacency Labeling Schemes and Induced-Universal Graphs ⋮ An adjacency labeling scheme based on a decomposition of trees into caterpillars ⋮ Near-optimal induced universal graphs for cycles and paths ⋮ Logical labeling schemes ⋮ Implicit representation of relations ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ Unnamed Item ⋮ Asymptotically optimal induced universal graphs ⋮ Right-angled Coxeter groups, universal graphs, and Eulerian polynomials ⋮ Fault-tolerant distance labeling for planar graphs ⋮ Shorter Labeling Schemes for Planar Graphs ⋮ Fault-tolerant distance labeling for planar graphs
This page was built for publication: Optimal Induced Universal Graphs and Adjacency Labeling for Trees
