Finding maximum flows in undirected graphs seems easier than bipartite matching

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1998, Pages 69-78

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

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; POLYNOMIALS;

BIPARTITE MATCHING;

GRAPH THEORY;

EID: 0031639850     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/276698.276714     Document Type: Conference Paper

References (18)