Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs
From MaRDI portal
Publication:3527249
DOI10.1007/978-3-540-75520-3_52zbMath1151.68565MaRDI QIDQ3527249
Cyril Gavoille, Arnaud Labourel
Publication date: 25 September 2008
Published in: Algorithms – ESA 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-75520-3_52
Related Items
Adjacency Labeling Schemes and Induced-Universal Graphs, Optimal induced universal graphs for bounded-degree graphs, Induced Universal Hypergraphs, Isometric Universal Graphs, Twin-width II: small classes, Shorter Labeling Schemes for Planar Graphs, The space complexity of sum labelling, Compact navigation and distance oracles for graphs with small treewidth, Asymptotically optimal induced universal graphs, The space complexity of sum labelling, An adjacency labeling scheme based on a decomposition of trees into caterpillars, Near-optimal induced universal graphs for cycles and paths, Compact representation of graphs with bounded bandwidth or treedepth, Compact Navigation and Distance Oracles for Graphs with Small Treewidth