Minimizing cyclic cutwidth of graphs using a memetic algorithm

Pallavi Jain, Kamal Srivastava, Gur Saran

Research output: Contribution to journalArticlepeer-review

7 Scopus citations


Cyclic cutwidth minimization problem (CCMP) consists of embedding a graph onto a circle such that the maximum cutwidth in a region is minimized. It is an NP-complete problem and for some classes of graphs, exact results of cyclic cutwidth have been proved in literature. However, no algorithm has been reported for general graphs. In this paper, a memetic algorithm is proposed for CCMP in which we have designed six construction heuristics in order to generate a good initial population and also local search is employed to improve the solutions in each generational phase. The algorithm achieves optimal results for the classes of graphs with known exact results. Extensive experiments have also been conducted on some classes of graphs for which exact results are not known such as the complete split graph, join of hypercubes, toroidal meshes, cone graph and some instances of Harwell-Boeing graphs which are a subset of public domain Matrix Market library. Trends observed in the experimental results for some of the classes of graphs have led to conjectures for cyclic cutwidth.

Original languageEnglish
Pages (from-to)815-848
Number of pages34
JournalJournal of Heuristics
Issue number6
StatePublished - 1 Dec 2016
Externally publishedYes


  • Cyclic cutwidth
  • Graph layout problems
  • Memetic algorithm

ASJC Scopus subject areas

  • Software
  • Information Systems
  • Computer Networks and Communications
  • Control and Optimization
  • Management Science and Operations Research
  • Artificial Intelligence


Dive into the research topics of 'Minimizing cyclic cutwidth of graphs using a memetic algorithm'. Together they form a unique fingerprint.

Cite this