Pages that link to "Item:Q3588402"
From MaRDI portal
The following pages link to Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs (Q3588402):
Displaying 6 items.
- \(k\)-outerplanar graphs, planar duality, and low stretch spanning trees (Q634672) (← links)
- Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs (Q664543) (← links)
- An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs (Q3088092) (← links)
- Computing Best and Worst Shortcuts of Graphs Embedded in Metric Spaces (Q3597878) (← links)
- Using Petal-Decompositions to Build a Low Stretch Spanning Tree (Q4629391) (← links)
- Algorithms – ESA 2004 (Q5464574) (← links)