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

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, w...

Full description

Saved in:

Bibliographic Details
Published in:	Discrete Applied Mathematics Vol. 160; no. 6; pp. 708 - 733
Main Authors:	Gioan, Emeric, Paul, Christophe
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.04.2012 Elsevier
Subjects:	Algorithms Character recognition Combinatorial analysis Computer Science Decomposition Discrete Mathematics Distance hereditary graphs Dynamics Fully dynamic algorithms Graphs Mathematical models Split decomposition Trees Distance hereditary graphs Split decomposition Fully dynamic algorithms
ISSN:	0166-218X, 1872-6771
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!