Optimal tree 3-spanners in directed path graphs
From MaRDI portal
Recommendations
- On tree 3‐spanners in directed path graphs
- Characterization and recognition of tree 3-spanner admissible directed path graphs of diameter three
- Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction
- Tree 3-Spanner in 2-sep Chordal Graphs: Characterization, Recognition, and Construction.
- Tree Spanners
Cites work
- A recognition algorithm for the intersection graphs of directed paths in directed trees
- A recognition algorithm for the intersection graphs of paths in trees
- Distance Approximating Trees for Chordal and Dually Chordal Graphs
- Graph spanners
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- Tree 3-spanners on interval, permutation and regular bipartite graphs
- Tree Spanners
Cited in
(10)- Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction
- Characterization and recognition of tree 3-spanner admissible directed path graphs of diameter three
- Tree spanners of bounded degree graphs
- Tree spanners on chordal graphs: complexity and algorithms
- Additive sparse spanners for graphs with bounded length of largest induced cycle
- Tree 3-Spanner in 2-sep Chordal Graphs: Characterization, Recognition, and Construction.
- A linear time algorithm to construct a tree 4-spanner on trapezoid graphs
- An optimal parallel algorithm to construct a tree 3-spanner on interval graphs
- On tree 3‐spanners in directed path graphs
- Tree 3-spanners in 2-sep chordal graphs: characterization and algorithms
This page was built for publication: Optimal tree 3-spanners in directed path graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4267388)