3 papers
cs.DM2021
(α, β)-Modules in Graphs
Michel Habib, Lalla Mouatadid, Eric Sopena +1
Modular Decomposition focuses on repeatedly identifying a module M (a collection of vertices that shares exactly the same neighbourhood outside of M) and collapsing it into a singl…
cs.DS2017
Maximum Induced Matching Algorithms via Vertex Ordering Characterizations
Michel Habib, Lalla Mouatadid
We study the maximum induced matching problem on a graph g. Induced matchings correspond to independent sets in L2(g), the square of the line graph of g. The problem is NP-complete…
cs.DM2015
Path Graphs, Clique Trees, and Flowers
Lalla Mouatadid, Robert Robere
An \emph{asteroidal triple} is a set of three independent vertices in a graph such that any two vertices in the set are connected by a path which avoids the neighbourhood of the th…