A new approach to maximum matching in general graphs
本文檔由 technic123 分享于2011-11-26 15:10
We reduce the problem of finding an augmenting path in a general graph to a reachability problem and showthat a slight modification of depth-first search leads to an algorithm for finding such paths. As a consequence,we obtain a straightforward algorithm for maximum matching in general graphs of time complexity O(n^(1/2)*m),where n is the number of nodes and m is th..
- 文檔格式：
- 文檔大?。?/dt>
- 819.41K
- 文檔頁數(shù)：
- 12頁
- 頂 /踩數(shù)：
- 0 / 0
- 收藏人數(shù)：
- 0
- 評論次數(shù)：
- 0
- 文檔熱度：
- 文檔分類：
- IT計(jì)算機(jī) — 數(shù)據(jù)結(jié)構(gòu)與算法
- 添加到豆單
下載文檔
收藏