Treffer: Simple and fast: Improving a branch-and-bound algorithm for maximum clique
Title:
Simple and fast: Improving a branch-and-bound algorithm for maximum clique
Authors:
Source:
Algorithms - ESA 2002 (Rome, 17-21 September 2002)Lecture notes in computer science. :485-498
Publisher Information:
Berlin: Springer, 2002.
Publication Year:
2002
Physical Description:
print, 22 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Algorithme compétitif, Competitive algorithms, Clique graphe, Graph clique, Graphe non orienté, Non directed graph, Grafo no orientado, Méthode séparation et évaluation, Branch and bound method, Método branch and bound, Systématique, Taxonomy, Sistemática, Théorie graphe, Graph theory, Teoría grafo
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
University of Paderborn, Department of Mathematics and Computer Science, Fürstenallee 11, 33102 Paderborn, Germany
ISSN:
0302-9743
Rights:
Copyright 2003 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.14724917
Database:
PASCAL Archive
Weitere Informationen
We consider a branch-and-bound algorithm for maximum clique problems. We introduce cost based filtering techniques for the so-called candidate set (i.e. a set of nodes that can possibly extend the clique in the current choice point). Additionally, we present a taxonomy of upper bounds for maximum clique. Analytical results show that our cost based filtering is in a sense as tight as most of these well-known bounds for the maximum clique problem. Experiments demonstrate that the combination of cost based filtering and vertex coloring bounds outperforms the old approach as well as approaches that only apply either of these techniques. Furthermore, the new algorithm is competitive with other recent algorithms for maximum clique.