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 4 items.
- On approximating tree spanners that are breadth first search trees (Q269500) (← links)
- Line-distortion, bandwidth and path-length of a graph (Q521805) (← links)
- Tree spanners of bounded degree graphs (Q1693164) (← links)
- A short note on the complexity of computing strong pathbreadth (Q1705708) (← links)
