Approximation algorithms for the achromatic number

Conference · Sun Jun 01 00:00:00 EDT 1997

OSTI ID:471713

Chaudhary, A ^[1]; Vishwanathan, S ^[2]

---

1. Johns Hopkins Univ., Baltimore, MD (United States)
2. Indian Institute of Technology, Mumbai (India)

The achromatic number for a graph G = (V, E) is the largest integer m such that there is a partition of V into disjoint independent sets (V{sub 1},V{sub 2},..., V{sub m}) such that for each pair of distinct sets V{sub i}, V{sub j}, V{sub i} {union} V{sub j} is not an independent set in G. Yannakakis and Gavril proved that determining this value for general graphs is NP-complete. For n-vertex graphs we present the first O(n) approximation algorithm for this problem. We also present an O({radical}n) approximation algorithm for graphs with girth at least six and a constant approximation algorithm for trees.

• OSTI ID: 471713
• Report Number(s): CONF-970142--
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
ALGORITHMS
DIAGRAMS
PARTITION