Algorithm Theory - SWAT 2004
From MaRDI portal
Publication:5315403
Recommendations
- Collective tree spanners of graphs
- Collective tree spanners in graphs with bounded parameters
- Collective tree spanners for unit disk graphs with applications
- Graph-Theoretic Concepts in Computer Science
- Algorithms and Computation
- 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
- Collective Tree Spanners and Routing in AT-free Related Graphs
- Graph-Theoretic Concepts in Computer Science
- Collective additive tree spanners for circle graphs and polygonal graphs
Cited in
(15)- Collective Tree Spanners and Routing in AT-free Related Graphs
- Collective tree spanners in graphs with bounded parameters
- Collective tree spanners of graphs
- Notes on the Distributed Computation of Merge Trees on CW-Complexes
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences
- Collective additive tree spanners for circle graphs and polygonal graphs
- Additive 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
- Spanners for bounded tree-length graphs
- Collective tree spanners for unit disk graphs with applications
- Collective Additive Tree Spanners of Homogeneously Orderable Graphs
- Graph-Theoretic Concepts in Computer Science
- Algorithms and Computation
- Graph-Theoretic Concepts in Computer Science
This page was built for publication: Algorithm Theory - SWAT 2004
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5315403)