Bipartitive families and the bi-join decomposition

Fabien de Montgolfier (1) , Michael Rao (2)

1 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications
2 LITA - Laboratoire d'Informatique Théorique et Appliquée

This article introduces a new generalization of the modular decomposition called the bi-join decomposition. Like the split decomposition, it is an application of bipartitive families that are presented here. We show that the bi-join decomposition is unique, can be computed in linear time, and we give several characterizations for graphs completely decomposable by this decomposition.

Mots clés: graph; decomposition; modular decomposition; split decomposition; algorithm

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

Fabien de Montgolfier, Michael Rao. Bipartitive families and the bi-join decomposition. 2005. ⟨hal-00132862⟩