{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:42:27Z","timestamp":1759333347285},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1991,12,1]],"date-time":"1991-12-01T00:00:00Z","timestamp":691545600000},"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":[[1991,12]]},"DOI":"10.1007\/bf02257777","type":"journal-article","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T19:01:28Z","timestamp":1132686088000},"page":"321-341","source":"Crossref","is-referenced-by-count":42,"title":["Finding maximum cliques in arbitrary and in special graphs"],"prefix":"10.1007","volume":"46","author":[{"given":"L.","family":"Babel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02257777_CR1","unstructured":"Babel, L.: Ein Branch and Bound-Verfahren zur L\u00f6sung des Maximum Clique Problems. Dissertation, TU M\u00fcnchen (1990)."},{"key":"BF02257777_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\u2014Methods and Models of Operations Research34, 207\u2013217 (1990).","journal-title":"ZOR\u2014Methods and Models of Operations Research"},{"key":"BF02257777_CR3","volume-title":"Graphs and hypergraphs","author":"C. Berge","year":"1973","unstructured":"Berge, C.: Graphs and hypergraphs, Amsterdam: North Holland (1973)."},{"key":"BF02257777_CR4","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. of the ACM22, 251\u2013256 (1979).","journal-title":"Comm. of the ACM"},{"key":"BF02257777_CR5","volume-title":"Graph theory with applications to engineering and computer science","author":"N. Deo","year":"1974","unstructured":"Deo, N.: Graph theory with applications to engineering and computer science. New York: Prentice Hall (1974)."},{"key":"BF02257777_CR6","doi-asserted-by":"crossref","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"D. R. Fulkerson","year":"1965","unstructured":"Fulkerson, D. R., Gross, O. A.: Incidence matrices and interval graphs. Pacific J. Math.15, 835\u2013855 (1965).","journal-title":"Pacific J. Math."},{"key":"BF02257777_CR7","volume-title":"Computers and intractability","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., Johnson, D. S.: Computers and intractability. Freeman, N. Y. (1979)."},{"key":"BF02257777_CR8","volume-title":"Algorithmic graph theory and perfect graphs","author":"M. C. Golumbic","year":"1980","unstructured":"Golumbic, M. C.: Algorithmic graph theory and perfect graphs. New York: Academic Press (1980)."},{"key":"BF02257777_CR9","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1016\/0196-6774(85)90012-4","volume":"6","author":"D. S. Johnson","year":"1985","unstructured":"Johnson, D. S.: The NP-completeness column: an ongoing guide. J Algorithms6, 434\u2013451 (1985).","journal-title":"J Algorithms"},{"key":"BF02257777_CR10","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1016\/0196-6774(87)90021-6","volume":"8","author":"D. S. Johnson","year":"1987","unstructured":"Johnson, D. S.: The NP-completeness column: an ongoing guide. J Algorithms8, 438\u2013448 (1987).","journal-title":"J Algorithms"},{"key":"BF02257777_CR11","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1002\/net.3230130202","volume":"13","author":"J. A. Wald","year":"1983","unstructured":"Wald, J. A., Colbourn, C. J.: Steiner trees, partial 2-trees, and minimum IFI networks. Networks13, 159\u2013167 (1983).","journal-title":"Networks"},{"key":"BF02257777_CR12","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/978-3-7091-9076-0_10","volume-title":"Computational graph theory. Computing Suppl7","author":"D. Werra de","year":"1990","unstructured":"de Werra, D.: Heuristics for graph colorings. In: Tinhofer, G., (ed.), Computational graph theory. Computing Suppl7, 191\u2013208. Wien New York: Springer (1990)."},{"key":"BF02257777_CR13","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1145\/321607.321608","volume":"17","author":"J. G. Augustson","year":"1970","unstructured":"Augustson, J. G., Minker, J.: An analysis of some graph theoretical cluster techniques. J. of the ACM17, 571\u2013588 (1970).","journal-title":"J. of the ACM"},{"key":"BF02257777_CR14","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 covering algorithm. Naval Res. Log. Quart.24, 213\u2013233 (1977).","journal-title":"Naval Res. Log. Quart."},{"key":"BF02257777_CR15","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.1137\/0215075","volume":"15","author":"E. Balas","year":"1986","unstructured":"Balas, E., Yu, C. S.: Finding a maximum clique in an arbitrary graph. SIAM J. Computing15, 1054\u20131068 (1986).","journal-title":"SIAM J. Computing"},{"key":"BF02257777_CR16","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C. Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Finding all cliques of an undirected graph. Comm. of the ACM16, 575\u2013577 (1973).","journal-title":"Comm. of the ACM"},{"key":"BF02257777_CR17","doi-asserted-by":"crossref","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. Preprint, ORWP 3 (1989).","DOI":"10.1016\/0305-0548(90)90048-C"},{"key":"BF02257777_CR18","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF02248731","volume":"21","author":"L. Gerhards","year":"1979","unstructured":"Gerhards, L., Lindenberg, W.: Clique detection for nondirected graphs: Two new algorithms. Computing21, 295\u2013322 (1979).","journal-title":"Computing"},{"key":"BF02257777_CR19","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/0898-1221(83)90115-3","volume":"9","author":"E. Loukakis","year":"1983","unstructured":"Loukakis, E.: A new backtracking algorithm for generating the family of maximal independent sets of a graph. Comp. Math. Appl.9, 583\u2013589 (1983).","journal-title":"Comp. Math. Appl."},{"key":"BF02257777_CR20","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1080\/00207168208803311","volume":"11","author":"E. Loukakis","year":"1982","unstructured":"Loukakis, E., Tsouros, C.: Determining the number of internal stability of a graph. Intern. J. Comp. Math.11, 207\u2013220 (1982).","journal-title":"Intern. J. Comp. Math."},{"key":"BF02257777_CR21","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. Programming8, 232\u2013248 (1975).","journal-title":"Math. Programming"},{"key":"BF02257777_CR22","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1137\/0206038","volume":"6","author":"R. E. Tarjan","year":"1977","unstructured":"Tarjan, R. E., Trojanowski, A. E.: Finding a maximum independent set. SIAM J. Computing6, 537\u2013546 (1977).","journal-title":"SIAM J. Computing"},{"key":"BF02257777_CR23","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1137\/0214065","volume":"14","author":"D. G. Corneil","year":"1985","unstructured":"Corneil, D. G., Perl, Y., Stewart, L. K.: A linear recognition algorithm for cographs. SIAM J. Computing,14, 929\u2013934 (1985).","journal-title":"SIAM J. Computing"},{"key":"BF02257777_CR24","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1137\/0201013","volume":"1","author":"F. Gavril","year":"1972","unstructured":"Gavril, F.: Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph. SIAM J. Computing1, 180\u2013187 (1972).","journal-title":"SIAM J. Computing"},{"key":"BF02257777_CR25","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1002\/net.3230030305","volume":"3","author":"F. Gavril","year":"1973","unstructured":"Gavril, F.: Algorithms for a maximum clique and maximum independent set of a circle graph. Networks3, 261\u2013273 (1973).","journal-title":"Networks"},{"key":"BF02257777_CR26","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1002\/net.3230040407","volume":"4","author":"F. Gavril","year":"1974","unstructured":"Gavril, F.: Algorithms on circular-arc-graphs. Networks4, 357\u2013369 (1974).","journal-title":"Networks"},{"key":"BF02257777_CR27","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1016\/0196-6774(88)90023-5","volume":"9","author":"M. C. Golumbic","year":"1988","unstructured":"Golumbic, M. C., Hammer, P. L.: Stability in circular-arc-graphs. J Algorithms9, 314\u2013320 (1988).","journal-title":"J Algorithms"},{"key":"BF02257777_CR28","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1002\/net.3230120410","volume":"12","author":"U. Gupta","year":"1982","unstructured":"Gupta, U., Lee, D., Leung, J.: Efficient algorithms for interval graphs and circular-graphs. Networks12, 459\u2013467 (1982).","journal-title":"Networks"},{"key":"BF02257777_CR29","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF01589347","volume":"20","author":"W.-L. Hsu","year":"1981","unstructured":"Hsu, W.-L., Ikura, Y., Nemhauser, G. L.: A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles. Mathematical Programming20, 225\u2013232 (1981).","journal-title":"Mathematical Programming"},{"key":"BF02257777_CR30","first-page":"357","volume":"21","author":"W.-L. Hsu","year":"1984","unstructured":"Hsu, W.-L., Nemhauser, G. L.: Algorithms for maximum weight cliques, minimum weighted clique covers and minimum colorings of claw-free perfect graphs. Ann Discrete Math.21, 357\u2013369 (1984).","journal-title":"Ann Discrete Math."},{"key":"BF02257777_CR31","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1137\/0217003","volume":"17","author":"S. Masuda","year":"1988","unstructured":"Masuda, S., Nakajima, K.: An optimal algorithm for finding a maximum independent set of a circular-arc-graph. SIAM J. Computing17, 41\u201352 (1988).","journal-title":"SIAM J. Computing"},{"key":"BF02257777_CR32","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1002\/net.3230200203","volume":"20","author":"S. Masuda","year":"1990","unstructured":"Masuda, S., Nakajima, K., Kashiwabara, T., Fujisawa, T.: Efficient algorithms for finding maximum cliques of an overlap graph. Networks20, 157\u2013171 (1990).","journal-title":"Networks"},{"key":"BF02257777_CR33","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/0095-8956(80)90074-X","volume":"28","author":"G. J. Minty","year":"1980","unstructured":"Minty, G. J.: On maximal independent sets of vertices in claw-free graphs. J. Comb. Theory B28, 284\u2013304 (1980).","journal-title":"J. Comb. Theory B"},{"key":"BF02257777_CR34","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0020-0190(81)90041-7","volume":"13","author":"C. H. Papadimitriou","year":"1981","unstructured":"Papadimitriou, C. H., Yannakakis, M.: The clique problem for planar graphs. Inform. Proc. Letters13, 131\u2013133 (1981).","journal-title":"Inform. Proc. Letters"},{"key":"BF02257777_CR35","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"D. J. Rose","year":"1976","unstructured":"Rose, D. J., Tarjan, R. E., Lueker, G. S.: Algorithmic aspects of vertex elimination on graphs. SIAM J: Computing5, 266\u2013283 (1976).","journal-title":"SIAM J: Computing"},{"key":"BF02257777_CR36","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1002\/net.3230110305","volume":"11","author":"D. Rotem","year":"1981","unstructured":"Rotem, D., Urrutia, J.: Finding maximum cliques in circle graphs. Networks11, 269\u2013278 (1981).","journal-title":"Networks"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02257777.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02257777\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02257777","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T03:42:31Z","timestamp":1586576551000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02257777"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,12]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1991,12]]}},"alternative-id":["BF02257777"],"URL":"https:\/\/doi.org\/10.1007\/bf02257777","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,12]]}}}