12 citations · 41 across the 9 of their papers we have counts for
13 papers
Polynomial delay algorithm for minimal chordal completions
Caroline Brosse, Vincent Limouzy, Arnaud Mary
Motivated by the problem of enumerating all tree decompositions of a graph, we consider in this article the problem of listing all the minimal chordal completions of a graph. In \c…
Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes
Caroline Brosse, Aurélie Lagoutte, Vincent Limouzy +2
In this paper, we are interested in algorithms that take in input an arbitrary graph , and that enumerate in output all the (inclusion-wise) maximal "subgraphs" of which ful…
A general framework for enumerating equivalence classes of solutions
Yishu Wang, Arnaud Mary, Marie-France Sagot +1
When a problem has more than one solution, it is often important, depending on the underlying context, to enumerate (i.e., to list) them all. Even when the enumeration can be done…
The Perfect Matching Reconfiguration Problem
Marthe Bonamy, Nicolas Bousquet, Marc Heinrich +5
We study the perfect matching reconfiguration problem: Given two perfect matchings of a graph, is there a sequence of flip operations that transforms one into the other? Here, a fl…
Reconfiguration of graphs with connectivity constraints
Nicolas Bousquet, Arnaud Mary
A graph realizes the degree sequence if the degrees of its vertices is . Hakimi gave a necessary and sufficient condition to guarantee that there exists a connected mult…
Efficient enumeration of solutions produced by closure operations
Arnaud Mary, Yann Strozecki
In this paper we address the problem of generating all elements obtained by the saturation of an initial set by some operations. More precisely, we prove that we can generate the c…