Shorter Labeling Schemes for Planar Graphs
From MaRDI portal
Publication:5866447
Recommendations
- Shorter Labeling Schemes for Planar Graphs
- Adjacency Labelling for Planar Graphs (and Beyond)
- Shortcutting Planar Digraphs
- Short encodings of planar graphs and maps
- Distance constrained labelings of planar graphs with no short cycles
- The \(L(2,1)\)-labeling on planar graphs
- Labelings of two classes of plane graphs
- Labeling of planar graphs with a condition on distance two
- Labeling schemes for bounded degree graphs
- Simpler, faster and shorter labels for distances in graphs
Cites work
- scientific article; zbMATH DE number 1756017 (Why is no real title available?)
- scientific article; zbMATH DE number 1759444 (Why is no real title available?)
- scientific article; zbMATH DE number 6850320 (Why is no real title available?)
- scientific article; zbMATH DE number 3027510 (Why is no real title available?)
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A fast algorithm for the product structure of planar graphs
- Adjacency Labelling for Planar Graphs (and Beyond)
- Adjacency labeling schemes and induced-universal graphs
- An Optimal Ancestry Labeling Scheme with Applications to XML Trees and Universal Posets
- An improved planar graph product structure theorem
- Asymptotically optimal induced universal graphs
- Better distance labeling for unweighted planar graphs
- Compact and localized distributed data structures
- Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs
- Efficient graph representations
- Forbidden-set distance labels for graphs of bounded doubling dimension
- Graph minors. XX: Wagner's conjecture
- Implicat Representation of Graphs
- Induced-universal graphs for graphs with bounded maximum degree
- Informative labeling schemes for graphs
- Interval representations of planar graphs
- Labeling Schemes for Flow and Connectivity
- Labeling schemes for bounded degree graphs
- Layered separators in minor-closed graph classes with applications
- Near-optimal induced universal graphs for cycles and paths
- Near-optimal labeling schemes for nearest common ancestors
- Nearest common ancestors: a survey and a new algorithm for a distributed environment
- New routing techniques and their applications
- Notes on graph product structure theory
- On Graphs Which Contain All Sparse Graphs
- On Triangle Contact Graphs
- On induced-universal graphs for the class of bounded-degree graphs
- Optimal Distance Labeling for Interval Graphs and Related Graph Families
- Optimal distance labeling schemes for trees
- Optimal induced universal graphs and adjacency labeling for trees
- Planar graphs and poset dimension
- Planar graphs have 1-string representations
- Planar graphs have bounded nonrepetitive chromatic number
- Planar graphs have bounded queue-number
- Short Labels by Traversal and Jumping
- Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs
- Shorter Labeling Schemes for Planar Graphs
- Simpler, faster and shorter labels for distances in graphs
- Small universal graphs for bounded-degree planar graphs
- Splitting necklaces
- Sublinear-space distance labeling using hubs
- Succinct encodings for families of interval graphs
- Universal graphs and induced-universal graphs
Cited in
(8)- Shallow Minors, Graph Products, and Beyond-Planar Graphs
- Optimal adjacency labels for subgraphs of Cartesian products
- Short Labels by Traversal and Jumping
- Small but unwieldy: a lower bound on adjacency labels for small classes
- Adjacency Labelling for Planar Graphs (and Beyond)
- Product structure of graphs with an excluded minor
- Graph product structure for \(h\)-framed graphs
- Shortcutting Planar Digraphs
This page was built for publication: Shorter Labeling Schemes for Planar Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5866447)
