Title of article
Algorithms for clique-independent sets on subclasses of circular-arc graphs Original Research Article
Author/Authors
Guillermo Duran، نويسنده , , Min Chih Lin، نويسنده , , Sergio Mera، نويسنده , , Jayme Luiz Szwarcfiter، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
8
From page
1783
To page
1790
Abstract
A circular-arc graph is the intersection graph of arcs on a circle. A Helly circular-arc graph is a circular-arc graph admitting a model whose arcs satisfy the Helly property. A clique-independent set of a graph is a set of pairwise disjoint cliques of the graph. It is NP-hard to compute the maximum cardinality of a clique-independent set for a general graph.
Keywords
Algorithms , Circular-arc graphs , Helly circular-arc graphs , Clique-independent sets
Journal title
Discrete Applied Mathematics
Serial Year
2006
Journal title
Discrete Applied Mathematics
Record number
886326
Link To Document