![]() This is the case for the feedback problems that we examine, and thus the enumeration of all minimal admissible solutions provides a generic nonredundant description of the solution space. the supersets of admissible solutions are also admissible. Typically, solutions are subsets of a finite set, and the set of solutions is monotone, i.e. 1 Introduction Generating all admissible configurations is a well-examined problem for many combinatorial problems. Variants of the algorithm generate all minimal solutions for the undirected case and the directed feedback arc set problem, both with a polynomial delay of O Gamma jV j. The feedback vertex sets of G are generated with a polynomial delay of O Gamma jV j 2 (jV j + jEj) Delta. We present an algorithm that generates all (inclusion-wise) minimal feedback vertex sets of a directed graph G = (V E). ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |