Generating sparse spanners for weighted graphs
DOI10.1007/3-540-52846-6_75zbMATH Open1502.68198OpenAlexW1489900072MaRDI QIDQ5056089FDOQ5056089
Authors: Ingo Althöfer, David P. Dobkin, Deborah Joseph, Gautam K. Das 
Publication date: 9 December 2022
Published in: SWAT 90 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-52846-6_75
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Signed and weighted graphs (05C22)
Cites Work
- Reconstructing the shape of a tree from observed dissimilarity data
- Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
- A note on the tree realizability of a distance matrix
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Complexity of network synchronization
- An Optimal Synchronizer for the Hypercube
- Graph spanners
- On optimal realizations of finite metric spaces by graphs
- Shortest paths in Euclidean graphs
- Generating sparse spanners for weighted graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Regular d-valent graphs of girth 6 and 2(d2−d+1) vertices
- Title not available (Why is that?)
Cited In (14)
- On graph problems in a semi-streaming model
- Generating sparse 2—spanners
- Approximating Euclidean distances by small degree graphs
- Generating sparse spanners for weighted graphs
- Covering Metric Spaces by Few Trees
- Spanners in randomly weighted graphs: Euclidean case
- On sparse spanners of weighted graphs
- Graph theoretical issues in computer networks
- Title not available (Why is that?)
- Approximating \(k\)-spanner problems for \(k>2\)
- A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
- Covering metric spaces by few trees
- On additive spanners in weighted graphs with local error
- On dynamic shortest paths problems
This page was built for publication: Generating sparse spanners for weighted graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5056089)
