Time, complexity analysis of an evolutionary algorithm for finding nearly maximum cardinality matching
Research output: Contribution to journal › Article
Colleges, School and Institutes
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.
|Number of pages||9|
|Journal||Journal of Computer Science and Technology|
|Publication status||Published - 1 Jul 2004|
- evolutionary algorithm (EA), maximum matching, time complexity, combinatorial optimisation