Constructing sparse spanners for most graphs in higher dimensions

DOI10.1016/0020-0190(94)00104-9zbMath0941.68655OpenAlexW1966777891MaRDI QIDQ1336765

Barun Chandra

Publication date: 26 February 1996

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00104-9

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (3)

\( \delta \)-greedy \(t\)-spanner ⋮ Computing the greedy spanner in near-quadratic time ⋮ Light Euclidean Spanners with Steiner Points

Cites Work

• Unnamed Item
• Unnamed Item
• Delaunay graphs are almost as good as complete graphs
• On sparse spanners of weighted graphs
• NEW SPARSENESS RESULTS ON GRAPH SPANNERS
• Covering a sphere with spheres

This page was built for publication: Constructing sparse spanners for most graphs in higher dimensions