514 search results - page 1 / 103 » On enumerating all minimal solutions of feedback problems |
DAM
2002
13 years 4 months ago
2002
ICALP
2001
Springer
13 years 9 months ago
2001
Springer
We consider the problem of enumerating all minimal integer solutions of a monotone system of linear inequalities. We first show that for any monotone system of r linear inequaliti...
STACS
2007
Springer
13 years 11 months ago
2007
Springer
We contribute to the study of efficient enumeration algorithms for all solutions of constraint satisfaction problems. The only algorithm known so far, presented by Creignou and H´...
MST
2010
12 years 11 months ago
2010
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...
IPCO
2004
13 years 6 months ago
2004
We consider the problems of enumerating all minimal strongly connected subgraphs and all minimal dicuts of a given directed graph G = (V, E). We show that the first of these proble...