Distributed Relationship Schemes for Trees

DOI10.1007/978-3-540-77120-3_63zbMath1193.68086OpenAlexW1910571953MaRDI QIDQ5387807

Cyril Gavoille, Arnaud Labourel

Publication date: 27 May 2008

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77120-3_63

zbMATH Keywords

treedistanceancestrydistributed data-structures

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Separator Theorem for Chordal Graphs
• Distance and routing labeling schemes for non-positively curved plane graphs
• Universal graphs and induced-universal graphs
• Compact Separator Decompositions in Dynamic Trees and Applications to Labeling Schemes
• Distance labeling in graphs
• Compact and localized distributed data structures
• Proof labeling schemes
• Reconstructing approximate tree metrics
• Constructing Labeling Schemes Through Universal Matrices
• Compact Labeling Scheme for Ancestor Queries
• Labeling Schemes for Small Distances in Trees
• Algorithms and Computation
• Algorithms - ESA 2003
• Algorithms and Computation
• Algorithms and Computation

This page was built for publication: Distributed Relationship Schemes for Trees