Time complexity analysis of an evolutionary algorithm for finding nearly maximum cardinality matching

Jun HE, Xin YAO

Research output: Journal PublicationsJournal Article (refereed)peer-review

10 Citations (Scopus)

Abstract

Most of works on the time complexity analysis of evolutionary algorithms have always focused on some artificial binary problems. The time complexity of the algorithms for combinatorial optimisation has not been well understood. This paper considers the time complexity of an evolutionary algorithm for a classical combinatorial optimisation problem, to find the maximum cardinality matching in a graph. It is shown that the evolutionary algorithm can produce a matching with nearly maximum cardinality in average polynomial time.
Original languageEnglish
Pages (from-to)450-458
Number of pages9
JournalJournal of Computer Science and Technology
Volume19
Issue number4
DOIs
Publication statusPublished - Jul 2004
Externally publishedYes

Bibliographical note

The work is partially supported by Engineering and Physical Sciences Research Council (GR/R52541/O1) and State Key Lab of Software Engineering at "Wuhan University. The work was reported at UK 2002 Workshop on Computational Intelligence.

Keywords

  • Combinatorial optimisation
  • Evolutionary algorithm (EA)
  • Maximum matching
  • Time complexity

Fingerprint

Dive into the research topics of 'Time complexity analysis of an evolutionary algorithm for finding nearly maximum cardinality matching'. Together they form a unique fingerprint.

Cite this