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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Discrete Applied Mathematics Jg. 160; H. 6; S. 708 - 733
Hauptverfasser:	Gioan, Emeric, Paul, Christophe
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.04.2012 Elsevier
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!