5 citations · 13 across the 7 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.DS2015
Faster algorithms to enumerate hypergraph transversals
Manfred Cochefert, Jean-Francois Couturier, Serge Gaspers +1
A transversal of a hypergraph is a set of vertices intersecting each hyperedge. We design and analyze new exponential-time algorithms to enumerate all inclusion-minimal transversal…
cs.DS2015★ 2 cited
Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width
Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté +3
The linear induced matching width (LMIM-width) of a graph is a width parameter defined by using the notion of branch-decompositions of a set function on ternary trees. In this pape…