Generating Low-Degree 2-Spanners
From MaRDI portal
Publication:4210117
DOI10.1137/S0097539794268753zbMath0909.05023MaRDI QIDQ4210117
Publication date: 21 September 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (10)
Sparse hop spanners for unit disk graphs ⋮ Local heuristics and the emergence of spanning subgraphs in complex networks ⋮ Unnamed Item ⋮ Edge-disjoint spanners in Cartesian products of graphs ⋮ Unnamed Item ⋮ Graph spanners: a tutorial review ⋮ Edge-disjoint spanners in tori ⋮ Distributed Spanner Approximation ⋮ Bounded degree spanners of the hypercube ⋮ Edge-disjoint spanners of complete graphs and complete digraphs
This page was built for publication: Generating Low-Degree 2-Spanners
