Skip to main content
SpringerLink
Log in

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

Zur Ermittlung eines maximalen Matching in Graphen in O(|V|·|E|) Schritten

  • Published:
Computing Aims and scope Submit manuscript

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.

Zusammenfassung

Es wird ein Algorithmus zur Bestimmung eines Matching in beliebigen Graphen mitn Knoten undm Kanten angegeben, dessen Zeitaufwand vonk 1 mn+k 2 , wobeik 1 undk 2 Konstanten sind, beschränkt ist. Dieser Zeitaufwand entspricht der Anzahl der Schritten in einem “random access” Computer.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Balinski, M. L.: Labelling to obtain a maximum matching. Proc. Conf. Comb. Math. and Its Applications. Univ. North Carolina, April 1967.

  2. Berge, C.: Two theorems in graph theory. Proc. Natl. Acad. Sci.43, 842–844 (1957).

    Google Scholar 

  3. Berge, C.: Alternating chain methods: A survey, in “Graph Theory and Computing” (Read, R. C., ed.), New York-London: Academic Press. 1972.

    Google Scholar 

  4. Edmonds, J., Paths, trees, and flowers. Can. J. Math.19, 449–467 (1965).

    Google Scholar 

  5. Hopcroft, J. E., and R. M. Karp: An 5/2 algorithm for maximum matchings in bipartite graphs. Record of the 12th IEEE Annual Symp. on Switching and Automata, pp. 122–125. Oct. 1971.

  6. Tarjan, R. E.: Depth-first search and linear graph algorithms. SIAM J. Computing1, 146–159 (1972).

    Article  Google Scholar 

  7. Witzgall, C., and C. T. Zahn, Jr.: Modification of Edmonds' maximum matching algorithm. J. Res. Nat. Bur. Stds.69B, 91–98 (1965).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada

    T. Kameda

  2. Department of Applied Analysis and Computer Science, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada

    I. Munro

Authors
  1. T. Kameda
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. I. Munro
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

With 2 Figures

This work was supported in part by the National Research Council of Canada under grant no. A4315.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kameda, T., Munro, I. A O(|V|·|E|) algorithm for maximum matching of graphs. Computing 12, 91–98 (1974). https://doi.org/10.1007/BF02239502

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02239502

Keywords

Search

Navigation