Skip to main navigation
Skip to search
Skip to main content
Lingnan Scholars Home
Help & FAQ
Home
Researcher Profiles
Departments / Units
Research Outputs
Projects / Grants
Research Activities
Impacts
Prizes
Press/Media
Datasets
Student theses
Facilities / Equipments
Search by expertise, name or affiliation
Time complexity analysis of an evolutionary algorithm for finding nearly maximum cardinality matching
Jun HE,
Xin YAO
Research output
:
Journal Publications
›
Journal Article (refereed)
›
peer-review
10
Citations (Scopus)
Overview
Fingerprint
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.
Sort by
Weight
Alphabetically
Computer Science
Complexity Analysis
100%
Time Complexity
100%
Evolutionary Algorithms
100%
Cardinality
100%
Algorithms
25%
Combinatorial Optimization Problem
25%
Combinatorial Optimisation
25%
Polynomial Time
25%