论文信息 - An exact algorithm for the maximum clique problem - 字舞流文

An exact algorithm for the maximum clique problem

P. Pardalos | R. Carraghan

[1] Piotr Berman,et al. On the Complexity of Approximating the Independent Set Problem , 1989, Inf. Comput..

[2] Michel Gendreau,et al. An Efficient Implicit Enumeration Algorithm for the Maximum Clique Problem , 1988 .

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

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

[5] Robert E. Tarjan,et al. Finding a Maximum Independent Set , 1976, SIAM J. Comput..

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

[7] P. Turán. On the theory of graphs , 1954 .