Test case generators and computational results for the maximum clique problem |
| |
| Authors: | Jonas Hasselberg Panos M. Pardalos George Vairaktarakis |
| |
| Affiliation: | (1) Department of Computer Science, KTH, Royal Institute of Technology, Stockholm, Sweden;(2) Department of Industrial and Systems Engineering, University of Florida, 32611 Gainesville, FL, USA |
| |
| Abstract: | In the last years many algorithms have been proposed for solving the maximum clique problem. Most of these algorithms have been tested on randomly generated graphs. In this paper we present different test problem generators that arise from a variety of practical applications, as well as graphs with known maximum cliques. In addition, we provide computational experience with two exact algorithms using the generated test problems. |
| |
| Keywords: | Maximum clique problem testing global optimization |
| 本文献已被 SpringerLink 等数据库收录！ |
|
