Compact Routing Schemes for Bounded Tree-Length Graphs and for k-Chordal Graphs

DOI10.1007/978-3-540-30186-8_26zbMath1110.68337OpenAlexW1806052854MaRDI QIDQ5464203

Yon Dourisboure

Publication date: 17 August 2005

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-30186-8_26

zbMATH Keywords

chordalitycompact routingtree-decompositiontree-length

Mathematics Subject Classification ID

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

Related Items (2)

On the complexity of computing treelength ⋮ Tree-length equals branch-length

This page was built for publication: Compact Routing Schemes for Bounded Tree-Length Graphs and for k-Chordal Graphs