Engineering fast almost optimal algorithms for bipartite graph matching - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2020

Engineering fast almost optimal algorithms for bipartite graph matching

Algorithmes rapides quasi-optimaux pour trouver des couplages dans de graphes bipartis

Abstract

We consider the maximum cardinality matching problem in bipartite graphs. There are a number of exact, deterministic algorithms for this purpose, whose complexities are high in practice. There are randomized approaches for special classes of bipartite graphs. Random 2-out bipartite graphs, where each vertex chooses two neighbors at random from the other side, form one class for which there is an $O(m+n\log n)$-time Monte Carlo algorithm. Regular bipartite graphs, where all vertices have the same degree, form another class for which there is an expected $O(m + n\log n)$-time Las Vegas algorithm. We investigate these two algorithms and turn them into practical heuristics with randomization. Experimental results show that the heuristics are fast and obtain near optimal matchings. They are also more robust than the state of the art heuristics used in the cardinality matching algorithms, and are generally more useful as initialization routines.
Fichier principal
Vignette du fichier
ipbuESA20.pdf (731.01 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-02463717 , version 1 (01-02-2020)
hal-02463717 , version 2 (03-02-2020)
hal-02463717 , version 3 (01-07-2020)

Identifiers

  • HAL Id : hal-02463717 , version 3

Cite

Ioannis Panagiotas, Bora Uçar. Engineering fast almost optimal algorithms for bipartite graph matching. ESA 2020 - European Symposium on Algorithms, Sep 2020, Pisa, Italy. ⟨hal-02463717v3⟩
197 View
639 Download

Share

Gmail Mastodon Facebook X LinkedIn More