1 paper
Tony T. Lee, Bojun Lu, Hanli Chu
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 alte…