Tree 3-spanners in 2-sep chordal graphs: characterization and algorithms
From MaRDI portal
Publication:608275
DOI10.1016/j.dam.2010.08.015zbMath1215.05048OpenAlexW1966935039MaRDI QIDQ608275
Publication date: 25 November 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.08.015
Related Items (6)
Hardness and efficiency on minimizing maximum distances for graphs with few \(P_4\)'s and \((k, \ell)\)-graphs ⋮ Well-partitioned chordal graphs ⋮ Hardness and efficiency on minimizing maximum distances in spanning trees ⋮ Three problems on well-partitioned chordal graphs ⋮ Vulnerability of subclasses of chordal graphs ⋮ k-separator chordal graphs: leafage and subfamilies
Cites Work
- Reconstructing the shape of a tree from observed dissimilarity data
- Tree 3-spanners on interval, permutation and regular bipartite graphs
- Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction
- Characterizations of strongly chordal graphs
- On sparse spanners of weighted graphs
- Clique tree generalization and new subclasses of chordal graphs
- Restrictions of minimum spanner problems
- Tree spanners on chordal graphs: complexity and algorithms
- Intersection graphs of vertex disjoint paths in a tree
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Graph spanners
- Distance Approximating Trees for Chordal and Dually Chordal Graphs
- Optimal tree 3-spanners in directed path graphs
- Additive Tree Spanners
- Distributed Computing: A Locality-Sensitive Approach
- An Optimal Synchronizer for the Hypercube
- Tree Spanners
- On tree 3‐spanners in directed path graphs
- Tree spanners in planar graphs
This page was built for publication: Tree 3-spanners in 2-sep chordal graphs: characterization and algorithms
