Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs

DOI10.1007/978-3-540-75520-3_52zbMath1151.68565OpenAlexW1597567432MaRDI 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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (15)

Twin-width II: small classes ⋮ The space complexity of sum labelling ⋮ Adjacency Labeling Schemes and Induced-Universal Graphs ⋮ An adjacency labeling scheme based on a decomposition of trees into caterpillars ⋮ Compact representation of graphs with bounded bandwidth or treedepth ⋮ Near-optimal induced universal graphs for cycles and paths ⋮ Implicit representation of relations ⋮ Optimal induced universal graphs for bounded-degree graphs ⋮ Compact navigation and distance oracles for graphs with small treewidth ⋮ Induced Universal Hypergraphs ⋮ Compact Navigation and Distance Oracles for Graphs with Small Treewidth ⋮ Asymptotically optimal induced universal graphs ⋮ The space complexity of sum labelling ⋮ Isometric Universal Graphs ⋮ Shorter Labeling Schemes for Planar Graphs

This page was built for publication: Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs