Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

A Parallel Implementation for the Maximum Clique Problem

L.R. Thimm1, D.L. Kreher1, P. Merkey1
1Department of Mathematical Sciences Michigan Technological University Houghton MI 49931-1295
  • Published: 30/11/2007

Abstract

We discuss a parallel programming method for solving the maximum clique problem. We use the partitioned shared memory programming language, Unified Parallel C, for the parallel implementation. The problem of load balancing is discussed and the steal stack is used to solve this problem. Implementation details are provided.

Information
Guidelines
CP Initiatives
Follow CP
Facebook Twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
L.R. Thimm, D.L. Kreher, P. Merkey. A Parallel Implementation for the Maximum Clique Problem[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 063. 183-207. DOI: .