DocumentCode
2201627
Title
A n5/2 algorithm for maximum matchings in bipartite
Author
Hopcroft, John E. ; Karp, Richard M.
fYear
1971
fDate
13-15 Oct. 1971
Firstpage
122
Lastpage
125
Abstract
The present paper shows how to construct a maximum matching in a bipartite graph with n vertices and m edges in a number of computation steps proportional to (m+n) n.
Keywords
Algorithms; Bipartite graph; Computational complexity; Sparse matrices; Transportation; Tree graphs;
fLanguage
English
Publisher
ieee
Conference_Titel
Switching and Automata Theory, 1971., 12th Annual Symposium on
Conference_Location
East Lansing, MI, USA
ISSN
0272-4847
Type
conf
DOI
10.1109/SWAT.1971.1
Filename
4569670
Link To Document