Name
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. In the present paper, we propose polynomial time algorithms for finding the maximum cardinality and weight of a clique-independent set of a 3K2-free CA graph. Also, we apply the algorithms to the special case of an HCA graph. The complexity of the proposed algorithm for the cardinality problem in HCA graphs is O(n). This represents an improvement over the existing algorithm by Guruswami and Pandu Rangan, whose complexity is O(n2). These algorithms suppose that an HCA model of the graph is given. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1016/j.dam.2006.03.022 | Discrete Applied Mathematics |
Keywords | Field | DocType |
hca graph,clique-independent set,helly circular-arc graphs,circular-arc graphs,clique-independent sets,algorithms,cardinality problem,general graph,ca graph,helly circular-arc graph,circular-arc graph,maximum cardinality,hca model,helly property,intersection graph,independent set,polynomial time,satisfiability | Discrete mathematics,Combinatorics,Line graph,Clique graph,Graph property,Circle graph,Cubic graph,Algorithm,Null graph,Mathematics,Voltage graph,Complement graph | Journal |
Volume | Issue | ISSN |
154 | 13 | Discrete Applied Mathematics |
Citations | PageRank | References |
10 | 0.57 | 17 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Guillermo Durán | 1 | 296 | 29.28 |
| Min Chih Lin | 2 | 259 | 21.22 |
| Sergio Mera | 3 | 61 | 6.29 |
| Jayme Luiz Szwarcfiter | 4 | 618 | 95.79 |