
12-11-2009, 02:12 PM
|
| Super Moderator | | Join Date: Dec 2009
Posts: 246
Thanks: 0
Thanked 0 Times in 0 Posts
| |
A Catalog of Enumeration Algorithms HTML clipboard Since the given graph is bipartite, the problem for finding another perfect matching is reduced to a problem for finding a directed cycle of a auxiarly directed graph and so it requires O( n + m ) time Click Here To View Full Details |