Zobrazeno 1 - 1
of 1
pro vyhledávání: '"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 alternative alternating paths in the super-vertices shrunk from blossoms,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::21ff0a551c9250a91a0c7ea677305dab
