Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs
From MaRDI portal
Publication:3527249
Recommendations
Cited in
(22)- 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
- Implicat Representation of Graphs
- scientific article; zbMATH DE number 1262796 (Why is no real title available?)
- Adjacency labeling schemes and induced-universal graphs
- Optimal induced universal graphs for bounded-degree graphs
- Induced universal hypergraphs
- Compact navigation and distance oracles for graphs with small treewidth
- Implicit representations and factorial properties of graphs
- Isometric universal graphs
- Twin-width II: small classes
- Asymptotically optimal induced universal graphs
- Shorter Labeling Schemes for Planar Graphs
- Short Labels by Traversal and Jumping
- The space complexity of sum labelling
- Implicit representation of relations
- Small but unwieldy: a lower bound on adjacency labels for small classes
- Tight bounds on adjacency labels for monotone graph classes
- Title not available (Why is no real title available?)
This page was built for publication: Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3527249)