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

He, J. ORCID: 0000-0002-5616-4691 and Yao, X., 2004. Time complexity analysis of an evolutionary algorithm for finding nearly maximum cardinality matching. Journal of Computer Science and Technology, 19 (4), pp. 450-458. ISSN 1000-9000

Full text not available from this repository.
Item Type: Journal article
Publication Title: Journal of Computer Science and Technology
Creators: He, J. and Yao, X.
Publisher: Springer
Date: July 2004
Volume: 19
Number: 4
ISSN: 1000-9000
Identifiers:
NumberType
10.1007/bf02944746DOI
1262270Other
Divisions: Schools > School of Science and Technology
Record created by: Jonathan Gallacher
Date Added: 17 Jan 2020 14:35
Last Modified: 17 Jan 2020 14:35
URI: http://irep.ntu.ac.uk/id/eprint/39001

Actions (login required)

Edit View Edit View

Views

Views per month over past year

Downloads

Downloads per month over past year