Enumerate all minimum feedback arc sets
-
03-11-2019 - |
题
I am looking for (practically) efficient algorithms to enumerate all minimum feedback arc sets of a directed graph. What algorithms should I look at, with practical implementations in mind?
Currently I am using this algorithm to find all minimal solutions, then pick out the smallest ones:
没有正确的解决方案
不隶属于 cs.stackexchange