Pages that link to "Item:Q5741838"
From MaRDI portal
The following pages link to Mimicking Networks and Succinct Representations of Terminal Cuts (Q5741838):
Displaying 9 items.
- An exponential lower bound for cut sparsifiers in planar graphs (Q2324242) (← links)
- On mimicking networks representing minimum terminal cuts (Q2446595) (← links)
- Steiner Point Removal with Distortion $O(\log {k})$ using the Relaxed-Voronoi Algorithm (Q4634019) (← links)
- NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs (Q4994988) (← links)
- (Q5111733) (← links)
- (Q5111883) (← links)
- Refined Vertex Sparsifiers of Planar Graphs (Q5208742) (← links)
- Improved Guarantees for Vertex Sparsification in Planar Graphs (Q5208743) (← links)
- A constant-factor approximation for weighted bond cover (Q6671673) (← links)
