Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Chu, Hanli"'
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,
Externí odkaz:
http://arxiv.org/abs/2201.12811
