Maximum Matching in General Graphs Without Explicit Consideration of Blossoms Revisited

We reduce the problem of finding an augmenting path in a general graph to a reachability problem in a directed bipartite graph. A slight modification of depth-first search leads to an algorithm for finding such paths. Although this setting is equivalent to the traditional terminology of blossoms due...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2015-09
1. Verfasser:	Blum, Norbert
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Graph matching Graph theory Graphs
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!