1 citations · 1 across the 2 of their papers we have counts for
1 paper · 1 filter
Jiří Fink
We present an algorithm that enumerates all the perfect matchings in a given bipartite graph G = (V,E). Our algorithm requires a constant amortized time to visit one perfect matchi…