Fast algorithm for the maximum weight clique problem
被引:0
|
作者:
Babel, L.
论文数: 0引用数: 0
h-index: 0
机构:
Institut für Mathematik TU-München, Arcisstrasse 21, München, D-80290, GermanyInstitut für Mathematik TU-München, Arcisstrasse 21, München, D-80290, Germany
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.