A fast algorithm for the maximum weight clique problem

@article{Babel1994AFA,
  title={A fast algorithm for the maximum weight clique problem},
  author={Luitpold Babel},
  journal={Computing},
  year={1994},
  volume={52},
  pages={31-38}
}
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. Wir stellen eine Branch- and Bound-Methode zur Ermittlung einer Clique größten Gewichts in einem beliebigen… CONTINUE READING