Collective additive tree spanners for circle graphs and polygonal graphs
From MaRDI portal
Publication:444436
DOI10.1016/J.DAM.2012.03.036zbMATH Open1244.05216OpenAlexW2135166946MaRDI QIDQ444436FDOQ444436
Authors: Feodor F. Dragan, Ekkehard Köhler, Derek G. Corneil, Yang Xiang 
Publication date: 14 August 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.03.036
Recommendations
Cites Work
- Algorithmic graph theory and perfect graphs
- Distributed Computing: A Locality-Sensitive Approach
- Title not available (Why is that?)
- Title not available (Why is that?)
- There are planar graphs almost as good as the complete graph
- Title not available (Why is that?)
- An Optimal Synchronizer for the Hypercube
- Tree Spanners
- Graph spanners
- Additive graph spanners
- Recognition of Circle Graphs
- A tight bound on approximating arbitrary metrics by tree metrics
- Polygon Graph Recognition
- Traveling with a Pez Dispenser (or, Routing Issues in MPLS)
- Collective Tree Spanners and Routing in AT-free Related Graphs
- Collective tree spanners of graphs
- Additive sparse spanners for graphs with bounded length of largest induced cycle
- Additive Tree Spanners
- Proximity-preserving labeling schemes
- Distance approximating spanning trees
- Additive Spanners for Circle Graphs and Polygonal Graphs
- Graph-Theoretic Concepts in Computer Science
- Algorithms and Computation
Cited In (12)
- Algorithm Theory - SWAT 2004
- Additive tree \(O(\rho \log n)\)-spanners from tree breadth \(\rho \)
- Additive graph spanners
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences
- Additive Spanners for Circle Graphs and Polygonal Graphs
- How to use spanning trees to navigate in graphs
- Collective Additive Tree Spanners of Bounded Tree-Breadth Graphs with Generalizations and Consequences
- On polygon numbers of circle graphs and distance hereditary graphs
- Collective Additive Tree Spanners of Homogeneously Orderable Graphs
- Collective tree spanners for unit disk graphs with applications
- Clifford algebra and the discretizable molecular distance geometry problem
- Graph-Theoretic Concepts in Computer Science
This page was built for publication: Collective additive tree spanners for circle graphs and polygonal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q444436)
