Say I have a bipartite graph G with vertex set A and B when |A|=|B|=n and edge set E. Then how do I determine whether the graph has unique matching efficiently. I am not sure but the permanent of adjacency matrix will give the number of perfect matching. But it will take O(n^3) can it be done in O(n+e) if not what is the worst case complexity?.
Asked
Active
Viewed 30 times
