Distance labeling schemes for well-separated graph classes

DOI10.1016/j.dam.2004.03.005zbMath1056.05124OpenAlexW2022977787MaRDI QIDQ1765518

Michal Katz, Nir A. Katz, David Peleg

Publication date: 23 February 2005

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2004.03.005

zbMATH Keywords

Permutation graphsInterval graphsDistance in graphsLabeling schemes

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (3)

Labeling schemes for weighted dynamic trees ⋮ Randomized proof-labeling schemes ⋮ Localized and compact data-structure for comparability graphs

Cites Work

• An unexpected result in coding the vertices of a graph
• Labelling and Implicit Routing in Networks
• Compact and localized distributed data structures
• Coding the vertexes of a graph
• Interval routing schemes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Distance labeling schemes for well-separated graph classes