论文信息 - Tabaris: An exact algorithm based on tabu search for finding a maximum independent set in a graph

Tabaris: An exact algorithm based on tabu search for finding a maximum independent set in a graph

Abstract A technique for finding in a graph an independent set with maximum cardinality is presented. It consists of an implicit enumeration procedure; the procedure uses at various stages bounds on the independence number of a subgraph. These are obtained by applying an adaptation of Tabu Search. Computational results are given which show that with Tabu Search a competitive algorithm is obtained; the case of randomly generated graphs having up to 450 or 500 nodes (with edge density 0.5) can be handled by this approach.

[1] Fred W. Glover,et al. Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[2] E. Loukakis,et al. Determining the number of internal stability of a graph , 1982 .

[3] Najiba Sbihi,et al. Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoile , 1980, Discret. Math..

[4] Coenraad Bron,et al. Finding all cliques of an undirected graph , 1973 .

[5] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .

[6] Egon Balas,et al. Finding a Maximum Clique in an Arbitrary Graph , 1986, SIAM J. Comput..

[7] Fred Glover,et al. Tabu Search - Part II , 1989, INFORMS J. Comput..

[8] P. Hammer,et al. Pseudo-Boolean functions and stability of graphs , 1984 .

[9] Claude Berge,et al. Graphs and Hypergraphs , 2021, Clustering.

[10] Fred W. Glover,et al. Tabu Search - Part I , 1989, INFORMS J. Comput..

[11] A. Bonato,et al. Graphs and Hypergraphs , 2022 .

[12] C. Bron,et al. Algorithm 457: finding all cliques of an undirected graph , 1973 .