Tree spanners on chordal graphs: Complexity, algorithms, open problems
From MaRDI portal
Recommendations
- Tree spanners on chordal graphs: complexity and algorithms
- Tree 3-spanners in 2-sep chordal graphs: characterization and algorithms
- Tree Spanners
- Tree spanners in planar graphs. (Extended abstract)
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs
Cited in
(15)- Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs
- Tree spanners of bounded degree graphs
- Tree spanners on chordal graphs: complexity and algorithms
- Hardness and efficiency on minimizing maximum distances for graphs with few \(P_4\)'s and \((k, \ell)\)-graphs
- Tree \(t\)-spanners of a graph: minimizing maximum distances efficiently
- Additive sparse spanners for graphs with bounded length of largest induced cycle
- On tree-t-spanners in graphs
- An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs
- Tree Spanners
- scientific article; zbMATH DE number 804636 (Why is no real title available?)
- Tree \(t\)-spanners in outerplanar graphs via supply demand partition
- Tree spanners for bipartite graphs and probe interval graphs.
- Tree 3-spanners in 2-sep chordal graphs: characterization and algorithms
- Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs
This page was built for publication: Tree spanners on chordal graphs: Complexity, algorithms, open problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4425951)
