The following pages link to Computing mimicking networks (Q1969941):
Displaying 7 items.
- On mimicking networks representing minimum terminal cuts (Q2446595) (← links)
- Worst-case ratios of networks in the rectilinear plane (Q2764995) (← links)
- Tight Bounds for Gomory-Hu-like Cut Counting (Q3181053) (← links)
- NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs (Q4994988) (← links)
- Refined Vertex Sparsifiers of Planar Graphs (Q5208742) (← links)
- Improved Guarantees for Vertex Sparsification in Planar Graphs (Q5208743) (← links)
- Faster algorithms for shortest path and network flow based on graph decomposition (Q5240369) (← links)
