How to find all perfect matching in bipartite graph using Prolog?

360 Views Asked by At

I'm trying to find all perfect matching in bipartite graph and then do some nontrivial evaluations of each solution (nontrivial means, I can not use Hungarian algorithm). I use Prolog for this, is there any not exponential solution? (If the result is not exponential of course..)

0

There are 0 best solutions below