An approach for the maximum clique finding problem test tool software engineering

Authors:
Deniss Kumlander
Affiliations:
Department of Informatics, Tallinn University of Technology, Tallinn, Estonia
Venue:
SE'07 Proceedings of the 25th conference on IASTED International Multi-Conference: Software Engineering
Year:
2007

Citing 3
Cited 0

On-line bin-stretching

Theoretical Computer Science
On-line scheduling of parallel jobs with runtime restrictions

Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.