Additive Spanners for Circle Graphs and Polygonal Graphs
From MaRDI portal
Publication:5302048
DOI10.1007/978-3-540-92248-3_11zbMath1202.05024OpenAlexW1558783674MaRDI QIDQ5302048
Ekkehard Köhler, Feodor F. Dragan, Yang Xiang, Derek Gordon Corneil
Publication date: 20 January 2009
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-92248-3_11
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
Cites Work
- Unnamed Item
- Collective additive tree spanners for circle graphs and polygonal graphs
- There are planar graphs almost as good as the complete graph
- Algorithmic graph theory and perfect graphs
- Additive sparse spanners for graphs with bounded length of largest induced cycle
- Graph spanners
- Polygon Graph Recognition
- Distributed Computing: A Locality-Sensitive Approach
- Traveling with a Pez Dispenser (or, Routing Issues in MPLS)
- An Optimal Synchronizer for the Hypercube
- Tree Spanners
- Proximity-preserving labeling schemes
- Additive graph spanners
- Collective Tree Spanners and Routing in AT-free Related Graphs
- Collective tree spanners of graphs
- Graph-Theoretic Concepts in Computer Science
- Algorithms and Computation
- A tight bound on approximating arbitrary metrics by tree metrics
