Split decomposition and graph-labelled trees: characterizations and fully-dynamic algorithms for totally decomposable graphs

TL;DR

This paper introduces a unified framework using graph-labelled trees for split and modular decompositions, providing new characterizations and optimal dynamic algorithms for recognizing totally decomposable graphs and subclasses.

Contribution

It presents a novel framework that unifies split and modular decompositions, leading to new structural characterizations and efficient dynamic recognition algorithms for these graph classes.

Findings

Unified framework with graph-labelled trees for decompositions

Optimal fully-dynamic recognition algorithms for subclasses

Derived an intersection model for distance hereditary graphs

Abstract

In this paper, we revisit the split decomposition of graphs and give new combinatorial and algorithmic results for the class of totally decomposable graphs, also known as the distance hereditary graphs, and for two non-trivial subclasses, namely the cographs and the 3-leaf power graphs. Precisely, we give strutural and incremental characterizations, leading to optimal fully-dynamic recognition algorithms for vertex and edge modifications, for each of these classes. These results rely on a new framework to represent the split decomposition, namely the graph-labelled trees, which also captures the modular decomposition of graphs and thereby unify these two decompositions techniques. The point of the paper is to use bijections between these graph classes and trees whose nodes are labelled by cliques and stars. Doing so, we are also able to derive an intersection model for distance hereditary graphs, which answers an open problem.