COCOON
2009
Springer
14 years 2 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 ...
COMPGEOM
1995
ACM
14 years 3 months ago
1995
ACM
A convex polytope P can be speci ed in two ways: as the convex hull of the vertex set V of P, or as the intersection of the set H of its facet-inducing halfspaces. The vertex enum...
STACS
2007
Springer
14 years 5 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´...