D. Kumlander (Estonia)
Software engineering, NP-hard, maximum clique
The maximum clique problem is an important NP-hard task, which appears in many theoretical and practical applications. Therefore there is a great interest for a rapid implementation of new algorithms for that problem. Those algorithms’ evaluation and comparison can be done only using a test tool, which has to have either some common features for all local implementations or be a central service to provide adequate conditions for comparison tests. An approach for build such tool is proposed here both as guidelines for local implementations and as a starting point for standards’ development discussions.
Important Links:
Go Back
