A O(|V|*|E|) algorithm for maximum matching of graphs

Tiko Kameda, J. Ian Munro

Abstract: This paper presents an algorithm which finds a maximum matching in a graph withn nodes andm edges within timek 1 mn+k 2 , wherek 1 andk 2 are constants. It is also shown that a maximum degree-constrained subgraph can be found within timek 3 m 3 +k 4 , wherek 3 andk 4, are constants. Use of random access computer is assumed in the computation of the time bounds.