Linear-time modular decomposition of directed graphs

Ross Mcconnell , Fabien de Montgolfier (1)

1 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications

Modular decomposition of graphs is a powerful tool with many applications in graph theory and optimization. There are efficient linear-time algorithms that compute the decomposition for undirected graphs. The best previously published time bound for directed graphs is O(n + m log n), where n is the number of vertices and m is the number of edges. We give an O(n+m)-time algorithm.

Mots clés: modular decomposition; algorithm; tournaments; directed graphs; partitive families; tree-decomposable families; 2-structures

Domaines: Algorithme et structure de données [cs.DS]

Ross Mcconnell, Fabien de Montgolfier. Linear-time modular decomposition of directed graphs. Discrete Applied Mathematics, 2005, 145 (2), pp.189-209. ⟨hal-00159571⟩