Resilient and low stretch routing through embedding into tree metrics

DOI10.1007/978-3-642-22300-6_37zbMATH Open1342.68255OpenAlexW168729739MaRDI QIDQ5199263FDOQ5199263

Authors:

Publication date: 12 August 2011

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

Full work available at URL: https://doi.org/10.1007/978-3-642-22300-6_37

Recommendations

• Fault-tolerant approximate shortest-path trees
• Fault-tolerant approximate shortest-path trees
• On hierarchical routing in doubling metrics
• Ramsey spanning trees and their applications
• On hierarchical routing in doubling metrics

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Cited In (2)

• Tree embeddings for hop-constrained network design
• Ramsey spanning trees and their applications

This page was built for publication: Resilient and low stretch routing through embedding into tree metrics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5199263)