Searching for "On the Number of Small Cuts in a Graph." – sorted by Relevance.
-
On the Number of Small Cuts in a Graph
- On the Number of Small Cuts in a Graph Monika Rauch Henzinger Cornell University David P
- Cited by 3 (0 self) – Add To MetaCart
-
A Randomized Fully Polynomial Time Approximation Scheme for the All Terminal Network Reliability
- extensions of it, all relying on our observation regarding the number of small cuts a graph can have
- Cited by 34 (2 self) – Add To MetaCart
-
Minimum Cuts in Near-Linear Time
- of the concept of respecting constraint trees, we tighten the bounds on the number of small cuts in a graph
- Cited by 49 (11 self) – Add To MetaCart
-
Randomization in Graph Optimization Problems: A Survey
- on the number of small cuts a graph may contain; this has important applications in network reliability analysis
- Cited by 2 (0 self) – Add To MetaCart

