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 $G$, and that enumerate in output all the (inclusion-wise) maximal "subgraphs" of $G$ which ful…