Random sampling in residual graphs

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 63-66

  Karger, David R ^a   Levine, Matthew S ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FLOWCHARTING; GRAPH THEORY; PROBABILITY; SAMPLING; THEOREM PROVING;

FORD-FULKERSON ALGORITHM; MAXIMUM FLOW ALGORITHM; RANDOM SAMPLING; RESIDUAL GRAPH;

RANDOM PROCESSES;

EID: 0036039018     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/509914.509918     Document Type: Conference Paper

References (12)

1. 2) time
2. Network flow and testing graph connectivity
3. Maximal flow through a network
4. Beyond the flow decomposition barrier
5. Flows in undirected unit capacity networks
6. Using random sampling to find maximum flows in uncapacitated undirected graphs
7. Better random sampling algorithms for flows in undirected graphs
8. Random sampling in cut, flow, and network design problems
9. Funding maximum flows in simple undirected graphs seems faster than bipartite matching
10. A new approach to the minimum cut problem
11. Linear time algorithms for finding k-edge connected and k-node connected spanning subgraphs