Pages that link to "Item:Q5891880"
From MaRDI portal
The following pages link to Vertex Sparsifiers: New Results from Old Techniques (Q5891880):
Displaying 13 items.
- Metric decompositions of path-separable graphs (Q1679219) (← links)
- An exponential lower bound for cut sparsifiers in planar graphs (Q2324242) (← links)
- Terminal embeddings (Q2405893) (← links)
- Routing in Undirected Graphs with Constant Congestion (Q2817791) (← links)
- Steiner Point Removal with Distortion $O(\log {k})$ using the Relaxed-Voronoi Algorithm (Q4634019) (← links)
- (Q5009573) (← links)
- (Q5111733) (← links)
- Refined Vertex Sparsifiers of Planar Graphs (Q5208742) (← links)
- Improved Guarantees for Vertex Sparsification in Planar Graphs (Q5208743) (← links)
- (Q5875457) (← links)
- Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators (Q5918431) (← links)
- Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators (Q5925650) (← links)
- Reachability Preservers: New Extremal Bounds and Approximation Algorithms (Q6154193) (← links)
