Tree 3-spanners in 2-sep chordal graphs: characterization and algorithms
type: Item
instance of: scholarly article
title: Tree 3-spanners in 2-sep chordal graphs: characterization and algorithms
zbMATH Open document ID: 1215.05048
author: B. S. Panda
author: Anita Das
published in: Discrete Applied Mathematics
publication date: 2010-11-25T00:00:00Z
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5819505
zbMATH Keywords: tree spanner
zbMATH Keywords: distance in graphs
zbMATH Keywords: graph algorithms
zbMATH Keywords: 2-sep chordal graphs
MaRDI profile type: Publication
full work available at URL: j.dam.2010.08.015
OpenAlex ID: W1966935039
cites work: On sparse spanners of weighted graphs
cites work: Reconstructing the shape of a tree from observed dissimilarity data
cites work: Distance Approximating Trees for Chordal and Dually Chordal Graphs
cites work: Tree spanners on chordal graphs: complexity and algorithms
cites work: Tree Spanners
cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
cites work: Characterizations of strongly chordal graphs
cites work: Tree spanners in planar graphs
cites work: Additive Tree Spanners
cites work: Optimal tree 3-spanners in directed path graphs
cites work: Tree 3-spanners on interval, permutation and regular bipartite graphs
cites work: On tree 3‐spanners in directed path graphs
cites work: Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction
cites work: Intersection graphs of vertex disjoint paths in a tree
cites work: Distributed Computing: A Locality-Sensitive Approach
cites work: Graph spanners
cites work: An Optimal Synchronizer for the Hypercube
cites work: Clique tree generalization and new subclasses of chordal graphs
cites work: Restrictions of minimum spanner problems
DOI: 10.1016/J.DAM.2010.08.015
description: scientific article; zbMATH DE number 5819505