scientific article; zbMATH DE number 1500540

MaRDI QIDQ4501559zbMATH OpenFDO

Authors Michal Katz, Nir A. Katz, David Peleg

Publication date 13 June 2001

zbMATH Keywords

distance labeling schemesinterval graphspermutation graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Distance labeling schemes for well-separated graph classes
• Optimal Distance Labeling for Interval Graphs and Related Graph Families
• Optimal distance labeling for interval and circular-arc graphs
• Approximate distance labeling schemes
• scientific article; zbMATH DE number 1875437

Cited in

(18)

• Distance labeling scheme and split decomposition
• Distance labeling schemes for well-separated graph classes
• General compact labeling schemes for dynamic trees
• Distance labeling schemes for \(K_4\)-free bridged graphs
• Distance and routing labeling schemes for cube-free median graphs
• Tree-decompositions with bags of small diameter
• Informative labeling schemes for graphs
• Distance labeling in graphs (extended abstract)
• Separating Hierarchical and General Hub Labelings
• Optimal Distance Labeling for Interval Graphs and Related Graph Families
• Distance Labeling for Permutation Graphs
• Graph distance‐dependent labeling related to code assignment in computer networks
• Proximity-preserving labeling schemes
• Distance labeling schemes for cube-free median graphs
• Compact and localized distributed data structures
• Optimal distance labeling for interval and circular-arc graphs
• Logical labeling schemes
• Constructing labeling schemes through universal matrices

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501559)