Elsevier

Journal of Algorithms

Volume 41, Issue 2, November 2001, Pages 404-416
Journal of Algorithms

Regular Article
Approximation Algorithms for the Achromatic Number

https://doi.org/10.1006/jagm.2001.1192Get rights and content

Abstract

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 {V1, …, Vm} such that for each pair of distinct sets Vi, Vj, Vi  Vj is not an independent set in G. Yannakakis and Gavril (1980, SIAM J. Appl. Math.38, 364–372) 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(n5/12) approximation algorithm for graphs with girth at least 5 and a constant approximation algorithm for trees.

References (12)

There are more references available in the full text version of this article.

Cited by (9)

  • On the achromatic number of mesh like trees

    2020, Advances in Mathematics: Scientific Journal
  • On the achromatic number of silicate networks

    2013, International Journal of Pure and Applied Mathematics
  • An approximation algorithm for the achromatic number of circulant graphs G(n;±{1,2}), G(n;±{1,2,3})

    2011, Journal of Combinatorial Mathematics and Combinatorial Computing
View all citing articles on Scopus
View full text