Collective additive tree spanners for circle graphs and polygonal graphs
type: Item
instance of: scholarly article
title: Collective additive tree spanners for circle graphs and polygonal graphs
zbMATH Open document ID: 1244.05216
author: Feodor F. Dragan
author: Ekkehard Köhler
author: Derek G. Corneil
author: Yang Xiang
published in: Discrete Applied Mathematics
publication date: 2012-08-14T00:00:00Z
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6065734
zbMATH Keywords: graph algorithms
zbMATH Keywords: collective additive tree spanners
zbMATH Keywords: circle graphs
zbMATH Keywords: polygonal graphs
zbMATH Keywords: balanced separators
MaRDI profile type: Publication
full work available at URL: j.dam.2012.03.036
OpenAlex ID: W2135166946
cites work: Q4542533
cites work: Q4004055
cites work: Tree Spanners
cites work: Additive sparse spanners for graphs with bounded length of largest induced cycle
cites work: There are planar graphs almost as good as the complete graph
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Additive Spanners for Circle Graphs and Polygonal Graphs
cites work: Algorithms and Computation
cites work: Collective Tree Spanners and Routing in AT-free Related Graphs
cites work: Collective tree spanners of graphs
cites work: Polygon Graph Recognition
cites work: A tight bound on approximating arbitrary metrics by tree metrics
cites work: Algorithmic graph theory and perfect graphs
cites work: Traveling with a Pez Dispenser (or, Routing Issues in MPLS)
cites work: Additive graph spanners
cites work: Distributed Computing: A Locality-Sensitive Approach
cites work: Proximity-preserving labeling schemes
cites work: Graph spanners
cites work: An Optimal Synchronizer for the Hypercube
cites work: Distance approximating spanning trees
cites work: Additive Tree Spanners
cites work: Q4773020
cites work: Recognition of Circle Graphs
DOI: 10.1016/J.DAM.2012.03.036
description: scientific article; zbMATH DE number 6065734