Author:
Trukhanov Svyatoslav,Balasubramaniam Chitra,Balasundaram Balabhaskar,Butenko Sergiy
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics,Control and Optimization
Reference52 articles.
1. DIMACS Series on Discrete Mathematics and Theoretical Computer Science;J. Abello,1999
2. Applegate, D., Johnson, D.S.: dfmax.c [c program, second dimacs implementation challenge]. http://dimacs.rutgers.edu/pub/challenge/graph/solvers/
3. Babel, L.: Finding maximum cliques in arbitrary and in special graphs. Computing 46(4), 321–341 (1991)
4. Bader, J.S., Chaudhuri, A., Rothberg, J.M., Chant, J.: Gaining confidence in high-throughput protein interaction networks. Nat. Biotechnol. 22(1), 78–85 (2004)
5. Balas, E., Xue, J.: Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring. Algorithmica 15, 397–412 (1996)
Cited by
33 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献