DeepAI AI Chat
Log In Sign Up

A DFS Algorithm for Maximum Matchings in General Graphs

by   Tony T. Lee, et al.
The Chinese University of Hong Kong, Shenzhen

In this paper, we propose a depth-first search (DFS) algorithm for searching maximum matchings in general graphs. Unlike blossom shrinking algorithms, which store all possible alternative alternating paths in the super-vertices shrunk from blossoms, the newly proposed algorithm does not involve blossom shrinking. The basic idea is to deflect the alternating path when facing blossoms. The algorithm maintains detour information in an auxiliary stack to minimize the redundant data structures. A benefit of our technique is to avoid spending time on shrinking and expanding blossoms. This DFS algorithm can determine a maximum matching of a general graph with m edges and n vertices in O(mn) time with space complexity O(n).


page 1

page 2

page 3

page 4


Turán graphs with bounded matching number

We determine the maximum possible number of edges of a graph with n vert...

Searching isomorphic graphs

To determine that two given undirected graphs are isomorphic, we constru...

Alternating Path and Coloured Clustering

In the Coloured Clustering problem, we wish to colour vertices of an edg...

A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching

For a graph G=(V,E), finding a set of disjoint edges that do not share a...

Caterpillars and alternating paths

Let p(m) (respectively, q(m)) be the maximum number k such that any tree...

A Proof of the MV Matching Algorithm

The Micali-Vazirani (MV) algorithm for maximum cardinality matching in g...

Massively Parallel Path Space Filtering

Restricting path tracing to a small number of paths per pixel for perfor...