2 citations · 4 across the 6 of their papers we have counts for
3 papers · 2 filters
Counting Minimal Transversals of -Acyclic Hypergraphs
Benjamin Bergougnoux, Florent Capelli, Mamadou Moustapha Kanté
We prove that one can count in polynomial time the number of minimal transversals of -acyclic hypergraphs. In consequence, we can count in polynomial time the number of minimal…
On Minimum Connecting Transition Sets in Graphs
Thomas Bellitto, Benjamin Bergougnoux
A forbidden transition graph is a graph defined together with a set of permitted transitions i.e. unordered pair of adjacent edges that one may use consecutively in a walk in the g…
More applications of the d-neighbor equivalence: acyclicity and connectivity constraints
Benjamin Bergougnoux, Mamadou Moustapha Kanté
In this paper, we design a framework to obtain efficient algorithms for several problems with a global constraint (acyclicity or connectivity) such as Connected Dominating Set, Nod…