scientific article; zbMATH DE number 2079365

MaRDI QIDQ4471324zbMATH OpenFDO

Authors Béla Bollobás, Don Coppersmith, Michael Elkin

Publication date 28 July 2004

Mathematics Subject Classification ID

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

Recommendations

• Sparse Distance Preservers and Additive Spanners
• Small stretch pairwise spanners and approximate D-preservers
• Better distance preservers and additive spanners
• Sublinear Distance Labeling
• Approximating spanners and directed Steiner forest. Upper and lower bounds

Cited in

(12)

• Sparse Sourcewise and Pairwise Distance Preservers
• Small stretch pairwise spanners and approximate D-preservers
• Approximating Shortest Paths in Graphs
• Better distance preservers and additive spanners
• Approximating spanners and directed Steiner forest: upper and lower bounds
• Multipath spanners via fault-tolerant spanners
• Approximating spanners and directed Steiner forest. Upper and lower bounds
• Better Distance Preservers and Additive Spanners
• Distance-preserving subgraphs of interval graphs
• A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
• Sparse Distance Preservers and Additive Spanners
• Controllability backbone in multiagent networks

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 Q4471324)