Finding a maximum cardinality common independent set in two matroids (also known as
Matroid Intersection) is a classical combinatorial optimization problem, which generalizes …

Let $ G $ be an undirected graph, and $ s, t $ distinguished vertices of $ G $. A minimal $ s, t
$-separator is an inclusion-wise minimal vertex-set whose removal places $ s $ and $ t $ in …

Enumerating matchings is a classical problem in the field of enumeration algorithms. There
are polynomial-delay enumeration algorithms for several settings, such as enumerating …

Let G be an n-vertex graph, and s, t vertices of G. We present an efficient algorithm which
enumerates the set of minimal st-separators of G in ascending order of cardinality, with a …

In this paper, we propose a polynomial-delay and polynomial-space algorithm for
enumerating all minimal edge covers of an input graph G with cardinality at most t …

抄録 One way to measure the efficiency of enumeration algorithms is to evaluate it with
respect to the input size and the number of solutions. Since the number of solutions can be …