Compact Separator Decompositions in Dynamic Trees and Applications to Labeling Schemes

DOI10.1007/978-3-540-75142-7_25zbMath1145.68592OpenAlexW1547079575MaRDI QIDQ3523216

Amos Korman, David Peleg

Publication date: 2 September 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75142-7_25

zbMATH Keywords

distributed algorithmsdynamic networksgraph decompositionsinformative labeling schemesrouting schemes

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)

Related Items (2)

Distributed Relationship Schemes for Trees ⋮ Constructing labeling schemes through universal matrices

This page was built for publication: Compact Separator Decompositions in Dynamic Trees and Applications to Labeling Schemes