Maximum matchings in general graphs through randomization

Michael O. Rabin; Vijay V. Vazirani

doi:10.1016/0196-6774(89)90005-9

Maximum matchings in general graphs through randomization

Michael O. Rabin^*
, Vijay V. Vazirani

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

95 Scopus citations

Abstract

A new randomized algorithm for the maximum matching problem is presented. Unlike conventional matching algorithms which are combinatorial, our algorithm is algebraic and works on the Tutte matrix of the given graph. Although slower than the best known matching algorithm, our algorithm has the advantage of being conceptually simple and easy to program.

Original language	English
Pages (from-to)	557-567
Number of pages	11
Journal	Journal of Algorithms
Volume	10
Issue number	4
DOIs	https://doi.org/10.1016/0196-6774(89)90005-9
State	Published - Dec 1989
Externally published	Yes

Access to Document

10.1016/0196-6774(89)90005-9

Cite this

@article{8af8d254b3ea42d5b6a615bbb0126ec2,

title = "Maximum matchings in general graphs through randomization",

abstract = "A new randomized algorithm for the maximum matching problem is presented. Unlike conventional matching algorithms which are combinatorial, our algorithm is algebraic and works on the Tutte matrix of the given graph. Although slower than the best known matching algorithm, our algorithm has the advantage of being conceptually simple and easy to program.",

author = "Rabin, \{Michael O.\} and Vazirani, \{Vijay V.\}",

year = "1989",

month = dec,

doi = "10.1016/0196-6774(89)90005-9",

language = "אנגלית",

volume = "10",

pages = "557--567",

journal = "Journal of Algorithms",

issn = "0196-6774",

publisher = "Elsevier Inc.",

number = "4",

}

TY - JOUR

T1 - Maximum matchings in general graphs through randomization

AU - Rabin, Michael O.

AU - Vazirani, Vijay V.

PY - 1989/12

Y1 - 1989/12

N2 - A new randomized algorithm for the maximum matching problem is presented. Unlike conventional matching algorithms which are combinatorial, our algorithm is algebraic and works on the Tutte matrix of the given graph. Although slower than the best known matching algorithm, our algorithm has the advantage of being conceptually simple and easy to program.

AB - A new randomized algorithm for the maximum matching problem is presented. Unlike conventional matching algorithms which are combinatorial, our algorithm is algebraic and works on the Tutte matrix of the given graph. Although slower than the best known matching algorithm, our algorithm has the advantage of being conceptually simple and easy to program.

UR - https://www.scopus.com/pages/publications/38249024369

U2 - 10.1016/0196-6774(89)90005-9

DO - 10.1016/0196-6774(89)90005-9

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:38249024369

SN - 0196-6774

VL - 10

SP - 557

EP - 567

JO - Journal of Algorithms

JF - Journal of Algorithms

IS - 4

ER -

Maximum matchings in general graphs through randomization

Abstract

Access to Document

Other files and links

Fingerprint

Cite this