Counting number of perfect matching in bipartite graph.

159 Views Asked by At

Graph G is bipartite graph, I want to just count number of perfect matching. Is there any algorithm exist using combinatorial+graph theory, by which i cant count this. I tried by traversing the graph, but as there are so many possibilities and I just want number of perfect matching I asked here.