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