Geometric spanners of bounded tree-width
From MaRDI portal
Cites work
- A plane 1.88-spanner for points in convex position
- A Separator Theorem for Planar Graphs
- Algorithms for graphs of bounded treewidth via orthogonal range searching
- An improved upper bound on dilation of regular polygons
- Computing a minimum-dilation spanning tree is NP-hard
- Computing Geometric Minimum-Dilation Graphs Is NP-Hard
- Computing the greedy spanner in near-quadratic time
- Computing the Inverse Geodesic Length in Planar Graphs and Graphs of Bounded Treewidth
- CONSTRUCTING DEGREE-3 SPANNERS WITH OTHER SPARSENESS PROPERTIES
- Degree four plane spanners: simpler and better
- Euclidean minimum spanning trees and bichromatic closest pairs
- Geometric Spanner Networks
- Graph minors. I. Excluding a forest
- Graph minors. II. Algorithmic aspects of tree-width
- Greedy spanners in Euclidean spaces admit sublinear separators
- Handbook of Approximation Algorithms and Metaheuristics
- Low-degree minimum spanning trees
- Lower bounds on the dilation of plane spanners
- Obnoxious Centers in Graphs
- On plane geometric spanners: a survey and open problems
- On sparse spanners of weighted graphs
- On tree width, bramble size, and expansion
- Plane Spanners of Maximum Degree Six
- Quickly excluding a planar graph
- Sparse geometric graphs with small dilation
- Upper bounds to the clique width of graphs
This page was built for publication: Geometric spanners of bounded tree-width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7312670)
