Pages that link to "Item:Q1370655"
From MaRDI portal
The following pages link to Restrictions of minimum spanner problems (Q1370655):
Displaying 19 items.
- Tree 3-spanners in 2-sep chordal graphs: characterization and algorithms (Q608275) (← links)
- Hardness and approximation of minimum distortion embeddings (Q991793) (← links)
- On 2-detour subgraphs of the hypercube (Q1014814) (← links)
- Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction (Q1026118) (← 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)
- Minimum \(t\)-spanners on subcubic graphs (Q2154116) (← links)
- Mixed-integer programming approaches for the tree \(t^*\)-spanner problem (Q2329685) (← 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)
- Network flow spanners (Q3057178) (← links)
- COMPUTING GRAPH SPANNERS IN SMALL MEMORY: FAULT-TOLERANCE AND STREAMING (Q3084692) (← links)
- A linear time algorithm to construct a tree 4-spanner on trapezoid graphs (Q3568416) (← links)
- ON SPANNERS OF GEOMETRIC GRAPHS (Q3620618) (← links)
- An optimal parallel algorithm to construct a tree 3-spanner on interval graphs (Q4653706) (← links)
