Pages that link to "Item:Q5415509"
From MaRDI portal
The following pages link to On vertex sparsifiers with Steiner nodes (Q5415509):
Displaying 10 items.
- An exponential lower bound for cut sparsifiers in planar graphs (Q2324242) (← links)
- On mimicking networks representing minimum terminal cuts (Q2446595) (← links)
- Routing in Undirected Graphs with Constant Congestion (Q2817791) (← links)
- Vertex Sparsification in Trees (Q2971161) (← links)
- Steiner Point Removal with Distortion $O(\log {k})$ using the Relaxed-Voronoi Algorithm (Q4634019) (← links)
- (Q5111733) (← links)
- (Q5111883) (← links)
- Refined Vertex Sparsifiers of Planar Graphs (Q5208742) (← links)
- Improved Guarantees for Vertex Sparsification in Planar Graphs (Q5208743) (← links)
- Cutting Corners Cheaply, or How to Remove Steiner Points (Q5502176) (← links)
