Bipartitive families and the bi-join decomposition

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.