Algorithms and Computation
From MaRDI portal
Publication:5897891
DOI10.1007/11602613zbMATH Open1175.68290OpenAlexW2304246803MaRDI QIDQ5897891FDOQ5897891
Authors: Feodor F. Dragan, Chenyu Yan 
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
Recommendations
- Collective tree spanners in graphs with bounded parameters
- Algorithm Theory - SWAT 2004
- Collective tree spanners of graphs
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences
- Collective Additive Tree Spanners of Bounded Tree-Breadth Graphs with Generalizations and Consequences
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (13)
- Collective Tree Spanners and Routing in AT-free Related Graphs
- Easy computation of eccentricity approximating trees
- Collective tree spanners of graphs
- Collective tree spanners in graphs with bounded parameters
- Algorithm Theory - SWAT 2004
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences
- Additive Spanners for Circle Graphs and Polygonal Graphs
- Collective additive tree spanners for circle graphs and polygonal graphs
- Collective Additive Tree Spanners of Bounded Tree-Breadth Graphs with Generalizations and Consequences
- Covering metric spaces by few trees
- Collective Additive Tree Spanners of Homogeneously Orderable Graphs
- Graph-Theoretic Concepts in Computer Science
- Collective tree spanners for unit disk graphs with applications
This page was built for publication: Algorithms and Computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897891)
