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

17Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.

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 structural and incremental characterizations, leading to optimal fully dynamic recognition algorithms for vertex and edge modifications, for each of these classes. These results rely on the new combinatorial framework of graph-labelled trees used to represent the split decomposition of general graphs (and also the modular decomposition). The point of the paper is to use bijections between the aforementioned graph classes and graph-labelled trees whose nodes are labelled by cliques and stars. We mention that this bijective viewpoint yields directly an intersection model for the class of distance hereditary graphs. © 2011 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Gioan, E., & Paul, C. (2012). Split decomposition and graph-labelled trees: Characterizations and fully dynamic algorithms for totally decomposable graphs. In Discrete Applied Mathematics (Vol. 160, pp. 708–733). https://doi.org/10.1016/j.dam.2011.05.007

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free