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

Uloženo v:
Podrobná bibliografie
Vydáno v:Theoretical computer science Ročník 511; s. 54 - 65
Hlavní autoři: Belmonte, Rémy, Vatshelle, Martin
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 04.11.2013
Témata:
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 přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 polynomial of the input size. Combined with results of Bui-Xuan, Telle and Vatshelle (2013)  [1] this leads to polynomial time algorithms for a large class of locally checkable vertex subset and vertex partitioning problems on all of these graph classes. The boolean-width of a graph is related to the number of 1-neighborhoods and our results imply that any of these graph classes have boolean-width O(logn).
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2013.01.011