Graph classes with structured neighborhoods and algorithmic applications

Given a graph in any of the following graph classes: trapezoid graphs, circular permutation graphs, convex graphs, Dilworth k graphs, k-polygon graphs, circular arc graphs and complements of k-degenerate graphs, we show how to compute decompositions with the number of d-neighborhoods bounded by a po...

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 511; s. 54 - 65
Hlavní autori:	Belmonte, Rémy, Vatshelle, Martin
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 04.11.2013
Predmet:	Boolean-width Graph classes Graph decomposition Vertex partitioning problems Graph decomposition Boolean-width Graph classes Vertex partitioning problems
ISSN:	0304-3975, 1879-2294
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!