An Efficient Branch-and-bound Algorithm for Finding a Maximum Clique with Computational Experiments
- 6 July 2006
- journal article
- Published by Springer Nature in Journal of Global Optimization
- Vol. 37 (1) , 95-111
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- PROTEIN THREADING WITH PROFILES AND DISTANCE CONSTRAINTS USING CLIQUE BASED ALGORITHMSJournal of Bioinformatics and Computational Biology, 2006
- PROTEIN SIDE-CHAIN PACKING PROBLEM: A MAXIMUM EDGE-WEIGHT CLIQUE ALGORITHMIC APPROACHJournal of Bioinformatics and Computational Biology, 2005
- Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum CliqueLecture Notes in Computer Science, 2002
- The Maximum Clique Problem1999
- An exact quadratic 0-1 algorithm for the stable set problem1996
- Polyhedral methods for the maximum clique problem1996
- Cliques, Coloring, and Satisfiability1996
- Using symbolic techniques to find the maximum clique in very large sparse graphs1995
- An exact algorithm for the maximum clique problemOperations Research Letters, 1990
- Finding a Maximum Clique in an Arbitrary GraphSIAM Journal on Computing, 1986