Pages that link to "Item:Q868437"
From MaRDI portal
The following pages link to Tree spanners for bipartite graphs and probe interval graphs (Q868437):
Displaying 18 items.
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs (Q472490) (← links)
- Tree \(t\)-spanners in outerplanar graphs via supply demand partition (Q496441) (← links)
- Spanners in sparse graphs (Q657919) (← links)
- Tree 3-spanners on interval, permutation and regular bipartite graphs (Q671393) (← links)
- Parameterized complexity of the spanning tree congestion problem (Q1759686) (← links)
- Tree spanners on chordal graphs: complexity and algorithms (Q1884978) (← links)
- The minimum stretch spanning tree problem for typical graphs (Q2046233) (← links)
- Hardness and efficiency on minimizing maximum distances for graphs with few \(P_4\)'s and \((k, \ell)\)-graphs (Q2132367) (← links)
- Well-partitioned chordal graphs (Q2144581) (← links)
- Hardness and efficiency on minimizing maximum distances in spanning trees (Q2197544) (← links)
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences (Q2253192) (← links)
- Optimality computation of the minimum stretch spanning tree problem (Q2656713) (← 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)
- Complexity Results for the Spanning Tree Congestion Problem (Q3057608) (← links)
- An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs (Q3088092) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902514) (← links)
- Polynomial algorithms for sparse spanners on subcubic graphs (Q6621853) (← links)
