Using random sampling to find maximum flows in uncapacitated undirected graphs

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1997, Pages 240-249

  Karger, David R ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; POLYNOMIALS; PROBLEM SOLVING; RANDOM PROCESSES;

BLOCKING FLOWS; RANDOM SAMPLING;

GRAPH THEORY;

EID: 0030671645     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/258533.258596     Document Type: Conference Paper

References (19)