A recursive linear time modular decomposition algorithm via LexBFS
Abstract
A module of a graph G is a set of vertices that have the same set of neighbours outside. Modules of a graphs form a so-called partitive family and thereby can be represented by a unique tree MD(G), called the modular decomposition tree. Motivated by the central role of modules in numerous algorithmic graph theory questions, the problem of efficiently computing MD(G) has been investigated since the early 70's. To date the best algorithms run in linear time but are all rather complicated. By combining previous algorithmic paradigms developed for the problem, we are able to present a simpler linear-time that relies on very simple data-structures, namely slice decomposition and sequences of rooted ordered trees.
Keywords
Cite
@article{arxiv.0710.3901,
title = {A recursive linear time modular decomposition algorithm via LexBFS},
author = {Derek Corneil and Michel Habib and Christophe Paul and Marc Tedder},
journal= {arXiv preprint arXiv:0710.3901},
year = {2024}
}
Comments
An EA of this work appeared in ICALP'08. The arXiv v2 contains an appendix with some sketches of proofs. To date, complete proofs can only be found in the PhD of M. Tedder and spread over several chapters. This is a self-contained version. To ease the understanding, the noveI presentation enlights the combinatorial objects involved in the algorithm, which still relies on the same ideas