Publication:3836515
From MaRDI portal
zbMath0947.68112MaRDI QIDQ3836515
Publication date: 9 December 1999
Full work available at URL: https://eudml.org/doc/120593
68R10: Graph theory (including graph drawing) in computer science
Related Items
Approximation of minimum weight spanners for sparse graphs, Spanners in sparse graphs, A distance approximating trees, Combinatorial network abstraction by trees and distances, Spanners and message distribution in networks., The non-approximability of bicriteria network design problems, Tree-decompositions with bags of small diameter, Spanners for bounded tree-length graphs, Network flow spanners, A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs