1 citations · 1 across the 6 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DS2019
When Maximum Stable Set can be solved in FPT time
Édouard Bonnet, Nicolas Bousquet, Stéphan Thomassé +1
Maximum Independent Set (MIS for short) is in general graphs the paradigmatic -hard problem. In stark contrast, polynomial-time algorithms are known when the inputs are restr…
cs.DS2019
Constraint Generation Algorithm for the Minimum Connectivity Inference Problem
Édouard Bonnet, Diana-Elena Fălămaş, Rémi Watrigant
Given a hypergraph , the Minimum Connectivity Inference problem asks for a graph on the same vertex set as with the minimum number of edges such that the subgraph induced by…