A Catalog of Enumeration Algorithms
Since the given graph is bipartite, the problem for findig 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
Custom Search
Tuesday, June 3, 2008
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment