Optimal distance labeling for permutation graphs
From MaRDI portal
Cites work
- A simple and optimal ancestry labeling scheme for trees
- Adjacency labeling schemes and induced-universal graphs
- Adjacency labelling for planar graphs (and beyond)
- An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs
- An optimal ancestry scheme and small universal posets
- Asymptotically optimal induced universal graphs
- Better distance labeling for unweighted planar graphs
- Closing the gap: minimum space optimal time distance labeling scheme for interval graphs
- Compact Labeling Scheme for Ancestor Queries
- Constructing labeling schemes through universal matrices
- Distance Labeling for Permutation Graphs
- Distance labeling schemes for trees
- Distance labeling schemes for well-separated graph classes
- scientific article; zbMATH DE number 3908482 (Why is no real title available?)
- scientific article; zbMATH DE number 1756017 (Why is no real title available?)
- scientific article; zbMATH DE number 7765383 (Why is no real title available?)
- scientific article; zbMATH DE number 7788468 (Why is no real title available?)
- Implicat Representation of Graphs
- Induced-universal graphs for graphs with bounded maximum degree
- Informative labeling schemes for graphs
- Intersection Problems in Extremal Combinatorics: Theorems, Techniques and Questions Old and New
- Labeling schemes for nearest common ancestors through minor-universal trees
- Labeling schemes for vertex connectivity
- Localized and compact data-structure for comparability graphs
- Modular decomposition and transitive orientation
- On induced-universal graphs for the class of bounded-degree graphs
- On minimal n-universal graphs
- On testing isomorphism of permutation 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
- Optimal induced universal graphs for bounded-degree graphs
- Optimal labelling schemes for adjacency, comparability, and reachability
- Partial orders of dimension 2
- Permutation Graphs and Transitive Graphs
- Proximity-preserving labeling schemes
- Representing graphs by disks and balls (a survey of recognition-complexity results)
- Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs
- Shorter Labeling Schemes for Planar Graphs
- Simpler adjacency labeling for planar graphs with B-Trees
- Simpler, faster and shorter labels for distances in graphs
- Sublinear Distance Labeling
- Succinct encodings for families of interval graphs
- Succinct permutation graphs
- The implicit graph conjecture is false
- Tight bounds on adjacency labels for monotone graph classes
- Topics in Intersection Graph Theory
This page was built for publication: Optimal distance labeling for permutation graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7363172)
