Spanners in Sparse Graphs
From MaRDI portal
Publication:3521950
DOI10.1007/978-3-540-70575-8_49zbMath1153.68406OpenAlexW1485639233WikidataQ60488750 ScholiaQ60488750MaRDI QIDQ3521950
Petr A. Golovach, Feodor F. Dragan, Fedor V. Fomin
Publication date: 28 August 2008
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70575-8_49
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Tree spanners of bounded degree graphs, Approximation of minimum weight spanners for sparse graphs, Spanners in sparse graphs, Parameterized complexity of the spanning tree congestion problem, A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs, Complexity Results for the Spanning Tree Congestion Problem, Unnamed Item
