Constructing sparse spanners for most graphs in higher dimensions

DOI10.1016/0020-0190(94)00104-9MaRDI QIDQ1336765zbMATH OpenOpenAlexFDO

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

Cites work

• scientific article; zbMATH DE number 3932819 (Why is no real title available?)
• scientific article; zbMATH DE number 3259990 (Why is no real title available?)
• Covering a sphere with spheres
• Delaunay graphs are almost as good as complete graphs
• NEW SPARSENESS RESULTS ON GRAPH SPANNERS
• On sparse spanners of weighted graphs

Cited in

(3)

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

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

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