Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10334285 | Theoretical Computer Science | 2005 | 20 Pages |
Abstract
We present O(n2) time recognition algorithms for chordal gem-free graphs and for (P5,gem)-free graphs. Using a characterization of (P5,gem)-free graphs by their prime graphs with respect to modular decomposition and their modular decomposition trees [A. Brandstädt, D. Kratsch, On the structure of (P5,gem)-free graphs, Discrete Appl. Math. 145 (2005), 155-166], we give linear time algorithms for the following NP-complete problems on (P5,gem)-free graphs: Minimum Coloring; Maximum Weight Stable Set; Maximum Weight Clique; and Minimum Clique Cover.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy Spinrad,