scientific article; zbMATH DE number 2086374

MaRDI QIDQ4736828zbMATH OpenFDO

Authors Pierre Fraigniaud, Cyril Gavoille

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2285/22850065.htm

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Optimal Bounds for Matching Routing on Trees
• On the complexity of an optimal routing tree problem
• scientific article; zbMATH DE number 1303537
• A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
• On routing disjoint paths in bounded treewidth graphs
• Routing on trees via matchings
• Lower bounds for compact routing (extended abstract)
• scientific article; zbMATH DE number 1303574
• Exact algorithms for minimum routing cost trees
• On interval routing schemes and treewidth

Cited in

(14)

• A note on models for graph representations
• Compact routing messages in self-healing trees
• How to meet when you forget: log-space rendezvous in arbitrary graphs
• General compact labeling schemes for dynamic trees
• Randomized proof-labeling schemes
• Waypoint routing on bounded treewidth graphs
• Bounding the locality of distributed routing algorithms
• Compact separator decompositions in dynamic trees and applications to labeling schemes
• scientific article; zbMATH DE number 1756017 (Why is no real title available?)
• Lower bounds for compact routing (extended abstract)
• Compact and localized distributed data structures
• ON THE ROUTING NUMBER OF COMPLETE d-ARY TREES
• Compact Routing in Unit Disk Graphs
• How much memory is needed for leader election

This page was built for publication:

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