Pages that link to "Item:Q671393"
From MaRDI portal
The following pages link to Tree 3-spanners on interval, permutation and regular bipartite graphs (Q671393):
Displaying 22 items.
- Tree \(t\)-spanners in outerplanar graphs via supply demand partition (Q496441) (← links)
- Tree 3-spanners in 2-sep chordal graphs: characterization and algorithms (Q608275) (← links)
- Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction (Q1026118) (← links)
- Restrictions of minimum spanner problems (Q1370655) (← links)
- Tree spanners of bounded degree graphs (Q1693164) (← links)
- NP-hardness and fixed-parameter tractability of the minimum spanner problem (Q1784745) (← links)
- Tree spanners on chordal graphs: complexity and algorithms (Q1884978) (← links)
- The minimum stretch spanning tree problem for typical graphs (Q2046233) (← links)
- Well-partitioned chordal graphs (Q2144581) (← links)
- Hardness and efficiency on \(t\)-admissibility for graph operations (Q2231778) (← links)
- Spanners for bounded tree-length graphs (Q2383601) (← links)
- Eccentricity approximating trees (Q2410233) (← links)
- Additive sparse spanners for graphs with bounded length of largest induced cycle (Q2576868) (← links)
- Improved NP-hardness results for the minimum \(t\)-spanner problem on bounded-degree graphs (Q2682929) (← links)
- Three problems on well-partitioned chordal graphs (Q2692718) (← links)
- Minimum spanners of butterfly graphs (Q2719847) (← links)
- Eccentricity Approximating Trees (Q3181054) (← links)
- Additive tree 2-spanners of permutation graphs (Q3396414) (← links)
- A linear time algorithm to construct a tree 4-spanner on trapezoid graphs (Q3568416) (← links)
- Optimal tree 3-spanners in directed path graphs (Q4267388) (← links)
- An optimal parallel algorithm to construct a tree 3-spanner on interval graphs (Q4653706) (← links)
- Fast approximation of eccentricities and distances in hyperbolic graphs (Q4968378) (← links)
