{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:33:21Z","timestamp":1774416801020,"version":"3.50.1"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1994,3]]},"DOI":"10.1007\/bf02243394","type":"journal-article","created":{"date-parts":[[2005,11,14]],"date-time":"2005-11-14T16:19:02Z","timestamp":1131985142000},"page":"31-38","source":"Crossref","is-referenced-by-count":39,"title":["A fast algorithm for the maximum weight clique problem","Ein schneller Algorithmus f\u00fcr das gewichtete Maximum Clique Problem"],"prefix":"10.1007","volume":"52","author":[{"given":"L.","family":"Babel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02243394_CR1","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02257777","volume":"46","author":"L. Babel","year":"1991","unstructured":"Babel, L.: Finding maximum cliques in arbitrary and in special graphs. Computing46, 321\u2013341 (1991).","journal-title":"Computing"},{"key":"BF02243394_CR2","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF01415983","volume":"34","author":"L. Babel","year":"1990","unstructured":"Babel, L., Tinhofer, G.: A branch and bound algorithm for the maximum clique problem. ZOR-Meth. Models Oper. Res.34, 207\u2013217 (1990).","journal-title":"ZOR-Meth. Models Oper. Res."},{"key":"BF02243394_CR3","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1002\/nav.3800240203","volume":"24","author":"E. Balas","year":"1977","unstructured":"Balas, E., Samuelsson, H.: A node convering algorithm. Naval Res. Log. Q.24, 213\u2013233 (1977).","journal-title":"Naval Res. Log. Q."},{"key":"BF02243394_CR4","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1137\/0220012","volume":"20","author":"E. Balas","year":"1991","unstructured":"Balas, E., Xue, J.: Minimum weighted coloring of triangulated graphs, with application to maximum weight vertex packing and clique finding in arbitrary graphs. SIAM J. Comput.20, 209\u2013221 (1991); Addendum, SIAM J. Comput.21, 1000, 1992.","journal-title":"SIAM J. Comput."},{"key":"BF02243394_CR5","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.1137\/0215075","volume":"14","author":"E. Balas","year":"1986","unstructured":"Balas, E., Yu, C. S.: Finding a maximum clique in an arbitrary graph. SIAM J. Comput.14, 1054\u20131068 (1986).","journal-title":"SIAM J. Comput."},{"key":"BF02243394_CR6","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D. Brelaz","year":"1979","unstructured":"Brelaz, D.: New methods to color the vertices of a graph. Comm. ACM22, 251\u2013256 (1979).","journal-title":"Comm. ACM"},{"key":"BF02243394_CR7","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0167-6377(90)90057-C","volume":"9","author":"R. Carraghan","year":"1990","unstructured":"Carraghan, R., Pardalos, P. M.: An exact algorithm for the maximum clique problem. Operat. Res. Lett.9, 375\u2013382 (1990).","journal-title":"Operat. Res. Lett."},{"key":"BF02243394_CR8","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/0305-0548(90)90048-C","volume":"17","author":"C. Friden","year":"1990","unstructured":"Friden, C., Hertz, A., de Werra, D.: TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph. Comput. Operat. Res.17, 437\u2013445 (1990).","journal-title":"Comput. Operat. Res."},{"key":"BF02243394_CR9","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1080\/00207168308803357","volume":"13","author":"E. Loukakis","year":"1983","unstructured":"Loukakis, E., Tsouros, C.: An algorithm for the maximum internally stable set in a weighted graph. Int. J. Comput. Math.13, 117\u2013125 (1983).","journal-title":"Int. J. Comput. Math."},{"key":"BF02243394_CR10","unstructured":"Mannino, C., Sassano, A.: An exact algorithm for the maximum stable set problem. Technical Report R. 334 Istituto Di Analisi Dei Sistemi Ed Informatica Rome, 1992."},{"key":"BF02243394_CR11","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1057\/jors.1992.71","volume":"43","author":"G. L. Nemhauser","year":"1992","unstructured":"Nemhauser, G. L., Sigismondi, G.: A strong cutting plane\/branch-and-bound algorithm for node packing. J. Opl. Res. Soc.43, 443\u2013457 (1992).","journal-title":"J. Opl. Res. Soc."},{"key":"BF02243394_CR12","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/BF01580444","volume":"8","author":"G. L. Nemhauser","year":"1975","unstructured":"Nemhauser, G. L., Trotter, L. E.: Vertex packings: structural properties and algorithms. Math. Programm.8, 232\u2013248 (1975).","journal-title":"Math. Programm."},{"key":"BF02243394_CR13","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1080\/00207169108803967","volume":"38","author":"P. M. Pardalos","year":"1991","unstructured":"Pardalos, P. M., Desai, N.: An algorithm for finding a maximum weighted independent set in an arbitrary graph. Int. J. Comput. Math.38, 163\u2013175 (1991).","journal-title":"Int. J. Comput. Math."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02243394.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02243394\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02243394","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T19:27:40Z","timestamp":1557862060000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02243394"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["BF02243394"],"URL":"https:\/\/doi.org\/10.1007\/bf02243394","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}