Fundamenta Informaticae > 2017 > Vol. 154, nr 1/4 > 109--130
Source
Abstract
Identifiers
journal ISSN : | 0169-2968 |
journal e-ISSN : | 1875-8681 |
DOI | 10.3233/FI-2017-1555 |
Authors
Keywords
Additional information
Publisher
Fields of science
Bibliography
-
[1] Micali S, Vazirani VV. An O(√׀v׀∙׀E׀) algorithm for finding maximum matching in general graphs. In: Proc. 21st Annual Symp. on Found. of Comp. Sci. 1980 pp. 17–27. doi:10.1109/SFCS.1980.12 .
-
[2] Vazirani VV. A theory of alternating paths and blossoms for proving correctness of the O(√V E) general graph maximum matching algorithm. Combinatorica, 1994;14(1):71–109.
-
[3] Vazirani VV. A simplification of the MV matching algorithm and its proof. CoRR, abs/1210.4594v5. Also “A proof of the MV matching algorithm”, manuscript, May 13, 2014, 42 pages.