%0 Journal Article %1 Ostergard1999New %A Ostergard, P %D 1999 %J Electron. Notes Discret. Math. %K clique graph weight phd schemdesc %P 153--156 %R http://dx.doi.org/10.1016/S1571-0653(05)80045-9 %T A New Algorithm for the Maximum-Weight Clique Problem %U http://dx.doi.org/10.1016/S1571-0653(05)80045-9 %V 3 %X Given a graph, in the maximum clique problem one wants to and the largest number of vertices any two of which are adjacent. In the maximum-weight clique problem, the vertices have weights, and one wants to and a clique with maximum weight. A recently developed algorithm for the maximum clique problem is here transformed into an algorithm for the weighted case. Computational experiments with random graphs show that this new algorithm in many cases is faster than earlier algorithms.

@article{Ostergard1999New, abstract = {Given a graph, in the maximum clique problem one wants to and the largest number of vertices any two of which are adjacent. In the maximum-weight clique problem, the vertices have weights, and one wants to and a clique with maximum weight. A recently developed algorithm for the maximum clique problem is here transformed into an algorithm for the weighted case. Computational experiments with random graphs show that this new algorithm in many cases is faster than earlier algorithms.}, added-at = {2013-12-17T09:48:27.000+0100}, author = {Ostergard, P}, biburl = {https://www.bibsonomy.org/bibtex/23624f5a4c477e36205490676e5e60ff7/jullybobble}, doi = {http://dx.doi.org/10.1016/S1571-0653(05)80045-9}, interhash = {567da257c689d3101ccdcd0ecd3a9a01}, intrahash = {3624f5a4c477e36205490676e5e60ff7}, issn = {15710653}, journal = {Electron. Notes Discret. Math.}, keywords = {clique graph weight phd schemdesc}, month = may, pages = {153--156}, timestamp = {2014-07-27T15:43:19.000+0200}, title = {{A New Algorithm for the Maximum-Weight Clique Problem}}, url = {http://dx.doi.org/10.1016/S1571-0653(05)80045-9}, volume = 3, year = 1999 }