Distance Labeling for Permutation Graphs
DOI10.1016/J.ENDM.2005.06.098zbMATH Open1186.05111OpenAlexW1966909799MaRDI QIDQ3439382FDOQ3439382
Authors: Fabrice Bazzaro, Cyril Gavoille 
Publication date: 29 May 2007
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2005.06.098
Recommendations
- Distance labellings of graphs
- Distance labeling in graphs
- Distance and connectivity measures in permutation graphs
- Permutation labeling of graphs
- Distance labeling in graphs (extended abstract)
- Distance-two labelings of graphs
- Labeling bipartite permutation graphs with a condition at distance two
- scientific article; zbMATH DE number 1409224
- Distance magic labelling of graphs
- Permutation labeling for some special graphs
algorithmsdistributed algorithmspermutation graphsdata-structuredistance labeling schemedistance queries
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Topics in Intersection Graph Theory
- Distance labeling in graphs
- All-Pairs Almost Shortest Paths
- Partial orders of dimension 2
- Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs
- Interval representations of planar graphs
- Shortest paths in digraphs of small treewidth. I: Sequential algorithms
- Implicat Representation of Graphs
- Faster shortest-path algorithms for planar graphs
- Title not available (Why is that?)
- An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications
- Solving the all-pair shortest path query problem on interval and circular-arc graphs
- Distance labeling scheme and split decomposition
- Proximity-preserving labeling schemes
- Bypassing the embedding
- Approximate distance oracles
- The interval number of a planar graph: Three intervals suffice
- Title not available (Why is that?)
- Query efficient implementation of graphs of bounded clique-width
- Title not available (Why is that?)
- Title not available (Why is that?)
- Compact and localized distributed data structures
- Optimal distance labeling for interval and circular-arc graphs
Cited In (6)
- Localized and compact data-structure for comparability graphs
- \(O(1)\) query time algorithm for all pairs shortest distances on permutation graphs
- Distance and connectivity measures in permutation graphs
- Succinct permutation graphs
- Graph distance‐dependent labeling related to code assignment in computer networks
- Using Graphs for the Analysis and Construction of Permutation Distance-Preserving Mappings
This page was built for publication: Distance Labeling for Permutation Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439382)
