Improving the maximum-weight clique algorithm for the dense graphs

Authors:
Deniss Kumlander
Affiliations:
Department of Informatics, Tallinn University of Technology, Tallinn, Estonia
Venue:
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Year:
2006

Citing 3
Cited 2

Stereo Correspondence Through Feature Grouping and Maximal Cliques

IEEE Transactions on Pattern Analysis and Machine Intelligence
Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993

Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993
A new algorithm for the maximum-weight clique problem

Nordic Journal of Computing

Software for structured text entities dependency graph building

CEA'07 Proceedings of the 2007 annual Conference on International Conference on Computer Engineering and Applications
Real-time systems: incomplete solution approach for the maximum-weighted clique problem

AIA '08 Proceedings of the 26th IASTED International Conference on Artificial Intelligence and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a fast algorithm for the maximum-weight clique problem on arbitrary undirected graphs, which is improved for the dense graphs. The algorithm uses colour classes and backtracking techniques inside itself in parallel in a form of a branch and bound algorithm. The algorithm contains also several improvements for the most complex case, which are dense graphs. Computational experiments with random graphs show that the proposed algorithm works faster than earlier published algorithms - more than 10 times faster than the best known algorithms. This difference is very sufficient for the maximum-weight clique problem.