Distance labeling schemes for trees

DOI10.4230/LIPIcs.ICALP.2016.132zbMath1388.68206arXiv1507.04046OpenAlexW2964036887MaRDI QIDQ4598274

Esben Bistrup Halvorsen, Stephen Alstrup, Ely Porat, Inge Li Gørtz

Publication date: 19 December 2017

Full work available at URL: https://arxiv.org/abs/1507.04046

zbMATH Keywords

graph theorytreesdistributed computingroutingdistance labeling

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Data structures (68P05)

Related Items (6)

Better distance labeling for unweighted planar graphs ⋮ Implicit representation of relations ⋮ Distance and routing labeling schemes for cube-free median graphs ⋮ Better distance labeling for unweighted planar graphs ⋮ Unnamed Item ⋮ Isometric Universal Graphs

This page was built for publication: Distance labeling schemes for trees