Split Decomposition and Distance Labelling: An Optimal Scheme For Distance Hereditary Graphs

DOI10.1016/S1571-0653(04)00374-9zbMath1182.05046OpenAlexW2048121453MaRDI QIDQ3438963

Christophe Paul, 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/s1571-0653(04)00374-9

zbMATH Keywords

distance hereditary graphssplit decompositiondistance labelling scheme

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (5)

General compact labeling schemes for dynamic trees ⋮ Compact and localized distributed data structures ⋮ Labeling schemes for weighted dynamic trees ⋮ Randomized proof-labeling schemes ⋮ Constructing labeling schemes through universal matrices

This page was built for publication: Split Decomposition and Distance Labelling: An Optimal Scheme For Distance Hereditary Graphs