Some Improvements On Kumlander-S Maximum Weight Clique Extraction Algorithm
Satoshi Shimizu, Kazuaki Yamaguchi, Toshiki Saitoh, Sumio Masuda · Zenodo (CERN European Organization for Nuclear Research) · 2012
Some fast exact algorithms for the maximum weight clique problem have been proposed. Östergard’s algorithm is one of them. Kumlander says his algorithm is faster than it. But we confirmed that the straightforwardly implemented Kumlander’s algorithm is slower than O¨ sterga˚rd’s algorithm. We propose some improvements on Kumlander’s algorithm.