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

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 511; pp. 54 - 65
Main Authors:	Belmonte, Rémy, Vatshelle, Martin
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 04.11.2013
Subjects:	Boolean-width Graph classes Graph decomposition Vertex partitioning problems Graph decomposition Boolean-width Graph classes Vertex partitioning problems
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!