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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Discrete Applied Mathematics Ročník 160; číslo 6; s. 708 - 733
Hlavní autori:	Gioan, Emeric, Paul, Christophe
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.04.2012 Elsevier
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!