Fast algorithm for the maximum weight clique problem

被引：0

作者：

Babel, L. ^{[1
]}

机构：

[1] Institut für Mathematik TU-München, Arcisstrasse 21, München, D-80290, Germany

来源：

Computing (Vienna/New York) | 1994年 / 52卷 / 01期

关键词：

Graph theory - Heuristic methods - Linear programming - Matrix algebra - Vectors;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

We present a branch and bound method which finds a maximum weight clique in an arbitrary weighted graph. The main ingredients are a weighted coloring heuristic which simultaneously produces lower and upper bounds and a branching rule that uses the information obtained in the coloring. The algorithm performs comparable to the fastest method known so far but is much easier to implement.

引用

页码：31 / 38

共 50 条

[31] An exact algorithm for the maximum quasi-clique problem
Ribeiro, Celso C.
Riveaux, Jose A.
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2019, 26 (06) : 2199 - 2229
[32] Subgraph extraction and memetic algorithm for the maximum clique problem
Université de Technologie de Compiègne, Laboratoire Heudiasyc, UMR UTC-CNRS 6599, BP 20529, 60205 Compiègne, France
ICEC - Proc. Int. Conf. Evol. Comput., (77-84):
[33] An improved branch and bound algorithm for the maximum clique problem
Konc, Janez
Janezic, Dusanka
MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2007, 58 (03) : 569 - 590
[34] A simple simulated annealing algorithm for the maximum clique problem
Geng, Xiutang
Xu, Jin
Xiao, Jianhua
Pan, Linqiang
INFORMATION SCIENCES, 2007, 177 (22) : 5064 - 5071
[35] A Hybrid Algorithm with Simulated Annealing for the Maximum Clique Problem
Zhang Zhijie
JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2013, 10 (04) : 1044 - 1047
[36] An evolutionary algorithm with guided mutation for the maximum clique problem
Zhang, QF
Sun, JY
Tsang, E
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2005, 9 (02) : 192 - 200
[37] An efficient local search algorithm for solving maximum edge weight clique problem in large graphs
Chu, Yi
Liu, Boxiao
Cai, Shaowei
Luo, Chuan
You, Haihang
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2020, 39 (04) : 933 - 954
[38] A novel parallel local search algorithm for the maximum vertex weight clique problem in large graphs
Sevinc, Ender
Dokeroglu, Tansel
SOFT COMPUTING, 2020, 24 (05) : 3551 - 3567
[39] A novel parallel local search algorithm for the maximum vertex weight clique problem in large graphs
Ender Sevinc
Tansel Dokeroglu
Soft Computing, 2020, 24 : 3551 - 3567
[40] An efficient local search algorithm for solving maximum edge weight clique problem in large graphs
Yi Chu
Boxiao Liu
Shaowei Cai
Chuan Luo
Haihang You
Journal of Combinatorial Optimization, 2020, 39 : 933 - 954

← 1 2 3 4 5 →