514 search results - page 3 / 103 » On enumerating all minimal solutions of feedback problems |
ISAAC
2005
Springer
14 years 26 days ago
2005
Springer
Let G = (V, E) be an undirected graph, and let B ⊆ V × V be a collection of vertex pairs. We give an incremental polynomial time algorithm to enumerate all minimal edge sets X ...
ESA
2006
Springer
13 years 11 months ago
2006
Springer
We show that enumerating all minimal spanning and connected subsets of a given matroid is quasi-polynomially equivalent to the well-known hypergraph transversal problem, and thus ...
ECAI
2010
Springer
13 years 5 months ago
2010
Springer
We investigate the complexity of axiom pinpointing for different members of the DL-Lite family of Description Logics. More precisely, we consider the problem of enumerating all mi...
COCOON
2009
Springer
13 years 10 months ago
2009
Springer
We present new and more efficient algorithms for regular language enumeration problems. The min-word problem is to find the lexicographically minimal word of length n accepted by ...
ICALP
2005
Springer
14 years 26 days ago
2005
Springer
In this paper we initiate the study of the AND-OR directed feedback vertex set problem from the viewpoint of approximation algorithms. This AND-OR feedback vertex set problem is m...