17 citations · 42 across the 15 of their papers we have counts for
5 papers · 1 filter
An Upper Bound on the Size of Obstructions for Bounded Linear Rank-Width
Mamadou Moustapha Kanté, O-joung Kwon
We provide a doubly exponential upper bound in on the size of forbidden pivot-minors for symmetric or skew-symmetric matrices over a fixed finite field of linear r…
On the Enumeration of Minimal Dominating Sets and Related Notions
Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary +1
A dominating set in a graph is a subset of its vertex set such that each vertex is either in or has a neighbour in . In this paper, we are interested in the enumeration…
A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs
Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary +2
An output-polynomial algorithm for the listing of minimal dominating sets in graphs is a challenging open problem and is known to be equivalent to the well-known Transversal proble…
Polynomial Delay Algorithm for Listing Minimal Edge Dominating sets in Graphs
Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary +2
The Transversal problem, i.e, the enumeration of all the minimal transversals of a hypergraph in output-polynomial time, i.e, in time polynomial in its size and the cumulated size…
Linear rank-width of distance-hereditary graphs I. A polynomial-time algorithm
Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon
Linear rank-width is a linearized variation of rank-width, and it is deeply related to matroid path-width. In this paper, we show that the linear rank-width of every -vertex dis…