Pages that link to "Item:Q472490"
From MaRDI portal
The following pages link to An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs (Q472490):
Displaying 14 items.
- On approximating tree spanners that are breadth first search trees (Q269500) (← links)
- Line-distortion, bandwidth and path-length of a graph (Q521805) (← links)
- Computing the union join and subset graph of acyclic hypergraphs in subquadratic time (Q832905) (← links)
- Tree spanners of bounded degree graphs (Q1693164) (← links)
- A short note on the complexity of computing strong pathbreadth (Q1705708) (← links)
- On the complexity of computing treebreadth (Q1987233) (← links)
- Additive tree \(O(\rho \log n)\)-spanners from tree breadth \(\rho \) (Q2124229) (← links)
- Injective hulls of various graph classes (Q2155861) (← links)
- 3-colouring for dually chordal graphs and generalisations (Q2404614) (← links)
- Helly-gap of a graph and vertex eccentricities (Q2663046) (← links)
- On the Complexity of Computing Treebreadth (Q2819486) (← links)
- On Strong Tree-Breadth (Q2958304) (← links)
- Treelength of series-parallel graphs (Q6069145) (← links)
- Treewidth versus clique number. II: Tree-independence number (Q6144406) (← links)
