Algorithms and Computation
From MaRDI portal
Publication:5897891
DOI10.1007/11602613zbMath1175.68290OpenAlexW2304246803MaRDI QIDQ5897891
Publication date: 14 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11602613
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (6)
Collective tree spanners in graphs with bounded parameters ⋮ Additive Spanners for Circle Graphs and Polygonal Graphs ⋮ Covering metric spaces by few trees ⋮ Collective additive tree spanners for circle graphs and polygonal graphs ⋮ Easy computation of eccentricity approximating trees ⋮ Collective Additive Tree Spanners of Homogeneously Orderable Graphs
This page was built for publication: Algorithms and Computation
