Pages that link to "Item:Q1884978"

The following pages link to Tree spanners on chordal graphs: complexity and algorithms (Q1884978):

Displaying 33 items.

• On approximating tree spanners that are breadth first search trees (Q269500) (← links)
• 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)
• Tree 3-spanners in 2-sep chordal graphs: characterization and algorithms (Q608275) (← links)
• Spanners in sparse graphs (Q657919) (← links)
• Distance approximating trees for chordal and dually chordal graphs (extended abstract) (Q826072) (← links)
• Tree spanners for bipartite graphs and probe interval graphs (Q868437) (← links)
• Rooted directed path graphs are leaf powers (Q965972) (← links)
• Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction (Q1026118) (← links)
• Tree spanners of bounded degree graphs (Q1693164) (← links)
• Parameterized complexity of the spanning tree congestion problem (Q1759686) (← links)
• Isomorphic tree spanner problems (Q1899446) (← 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)
• Hardness and efficiency on \(t\)-admissibility for graph operations (Q2231778) (← links)
• Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences (Q2253192) (← links)
• Tree-decompositions with bags of small diameter (Q2370441) (← links)
• Spanners for bounded tree-length graphs (Q2383601) (← links)
• The zoo of tree spanner problems (Q2476246) (← links)
• Optimality computation of the minimum stretch spanning tree problem (Q2656713) (← links)
• Three problems on well-partitioned chordal graphs (Q2692718) (← links)
• Network flow spanners (Q3057178) (← 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)
• (Q3167174) (← links)
• Tree 3-Spanner in 2-sep Chordal Graphs: Characterization, Recognition, and Construction. (Q3439541) (← links)
• Distance Approximating Trees for Chordal and Dually Chordal Graphs (Q4228290) (← links)
• (Q4851642) (← links)
• Fast Diameter Computation within Split Graphs (Q5024674) (← links)
• Tree spanners in planar graphs (Q5928870) (← links)
• The minimum centroid branch spanning tree problem (Q6566796) (← links)