On the Pseudo-achromatic Number Problem

  • Authors:
  • Jianer Chen;Iyad A. Kanj;Jie Meng;Ge Xia;Fenghui Zhang

  • Affiliations:
  • Department of Computer Science, Texas A&M University, USA TX 77843;School of Computing, DePaul University, Supported by a DePaul University Competitive Research Grant, Chicago, USA IL 60604;Department of Computer Science, Texas A&M University, USA TX 77843;Department of Computer Science, Lafayette College, Supported by a Lafayette College Research Grant, Easton, USA PA 18042;Department of Computer Science, Texas A&M University, USA TX 77843

  • Venue:
  • Graph-Theoretic Concepts in Computer Science
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study the parameterized complexity of the pseudo-achromatic number problem: Given an undirected graph and a parameter k , determine if the graph can be partitioned into k groups such that every two groups are connected by at least one edge. This problem has been extensively studied in graph theory and combinatorial optimization. We show that the problem has a kernel of at most (k *** 2)(k + 1) vertices that is constructable in time $O(m\sqrt{n})$, where n and m are the number of vertices and edges, respectively, in the graph, and k is the parameter. This directly implies that the problem is fixed-parameter tractable. We also study generalizations of the problem and show that they are parameterized intractable.