{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T14:18:55Z","timestamp":1772893135029,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540405054","type":"print"},{"value":"9783540450665","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45066-1_22","type":"book-chapter","created":{"date-parts":[[2007,2,28]],"date-time":"2007-02-28T07:41:13Z","timestamp":1172648473000},"page":"278-289","source":"Crossref","is-referenced-by-count":107,"title":["An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique"],"prefix":"10.1007","author":[{"given":"Etsuji","family":"Tomita","sequence":"first","affiliation":[]},{"given":"Tomokazu","family":"Seki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1137\/0215075","volume":"15","author":"E. Balas","year":"1986","unstructured":"E. Balas and C.S. Yu: \u201cFinding a maximum clique in an arbitrary graph,\u201d SIAM J. Comput. 15, pp.1054\u20131068 (1986).","journal-title":"SIAM J. Comput."},{"key":"22_CR2","first-page":"143","volume":"13","author":"D. Bahadur K.C.","year":"2002","unstructured":"D. Bahadur K.C., T. Akutsu, E. Tomita, T. Seki, and A. Fujiyama: \u201cPoint matching under non-uniform distortions and protein side chain packing based on efficient maximum clique algorithms,\u201d Genome Informatics 13, pp.143\u2013152 (2002).","journal-title":"Genome Informatics"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"E. Balas, S. Ceria, G. Cornu\u00e9jols, and G. Pataki: \u201cPolyhedral methods for the maximum clique problem,\u201d pp.11\u201328 in [9] (1996).","DOI":"10.1090\/dimacs\/026\/02"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"I.M. Bomze, M. Budinich, P.M. Pardalos, and M. Pelillo: \u201cThe Maximum Clique Problem.\u201d In: D.-Z. Du and P.M. Pardalos (Eds.), Handbook of Combinatorial Optimization, Supplement vol. A, Kluwer Academic Publishers, pp.1\u201374 (1999).","DOI":"10.1007\/978-1-4757-3023-4_1"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"J.-M. Bourjolly, P. Gill, G. Laporte, and H. Mercure: \u201cAn exact quadratic 0\u20131 algorithm for the stable set problem,\u201d pp.53\u201373 in [9] (1996).","DOI":"10.1090\/dimacs\/026\/04"},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/0167-6377(90)90057-C","volume":"9","author":"R. Carraghan","year":"1990","unstructured":"R. Carraghan and P.M. Pardalos: \u201cAn exact algorithm for the maximum clique problem,\u201d Oper. Res. Lett. 9, pp.375\u2013382 (1990).","journal-title":"Oper. Res. Lett."},{"key":"22_CR7","unstructured":"T. Fujii and E. Tomita: \u201cOn efficient algorithms for finding a maximum clique,\u201d Technical Report of IECE (in Japanese), AL81-113, pp.25\u201334 (1982)."},{"key":"22_CR8","unstructured":"K. Hotta, E. Tomita, T. Seki, and H. Takahashi: \u201cObject detection method based on maximum cliques,\u201d Technical Report of IPSJ (in Japanese), 2002-MPS-42, pp.49\u201356 (2002)."},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"D. S. Johnson and M. A. Trick, (Eds.): \u201cCliques, Coloring, and Satisfiability,\u201d DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.26, American Mathematical Society (1996).","DOI":"10.1090\/dimacs\/026"},{"key":"22_CR10","unstructured":"S. Kobayashi, T. Kondo, K. Okuda, and E. Tomita: \u201cExtracting globally structure free sequences by local structure freeness,\u201d Technical Report CS 03-01, Dept. of Computer Science, Univ. of Electro-Communications (2003)."},{"key":"22_CR11","unstructured":"Y. Nakui, T. Nishino, E. Tomita, and T. Nakamura: \u201cOn the minimization of the quantum circuit depth based on a maximum clique with maximum vertex weight,\u201d Technical Report of Winter LA Symposium 2002, pp.9.1\u20139.7 (2003)."},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0166-218X(01)00290-6","volume":"120","author":"P.R.J. \u00d6sterg\u00e5rd","year":"2002","unstructured":"P.R.J. \u00d6sterg\u00e5rd: \u201cA fast algorithm for the maximum clique problem,\u201d Discrete Appl. Math. 120, pp.197\u2013207 (2002).","journal-title":"Discrete Appl. Math."},{"key":"22_CR13","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF01098364","volume":"4","author":"P.M. Pardalos","year":"1994","unstructured":"P.M. Pardalos and J. Xue: \u201cThe maximum clique problem,\u201d J. Global Optimization 4, pp. 301\u2013328 (1994).","journal-title":"J. Global Optimization"},{"key":"22_CR14","unstructured":"T. Seki and E. Tomita: \u201cEfficient branch-and-bound algorithms for finding a maximum clique,\u201d Technical Report of IEICE (in Japanese), COMP 2001-50, pp.101\u2013108 (2001)."},{"key":"22_CR15","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/ijoc.10.4.438","volume":"10","author":"E.C. Sewell","year":"1998","unstructured":"E.C. Sewell: \u201cA branch and bound algorithm for the stability number of a sparse graph,\u201d INFORMS J. Comput. 10, pp.438\u2013447 (1998).","journal-title":"INFORMS J. Comput."},{"key":"22_CR16","unstructured":"E. Tomita, Y. Kohata, and H. Takahashi: \u201cA simple algorithm for finding a maximum clique,\u201d Techical Report UEC-TR-C5, Dept. of Communications and Systems Engineering, Univ. of Electro communications (1988)."},{"key":"22_CR17","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0167-6377(97)00054-0","volume":"21","author":"D. R. Wood","year":"1997","unstructured":"D. R. Wood: \u201cAn algorithm for finding a maximum clique in a graph,\u201d Oper. Res. Lett. 21, pp.211\u2013217 (1997).","journal-title":"Oper. Res. Lett."}],"container-title":["Lecture Notes in Computer Science","Discrete Mathematics and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45066-1_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T20:18:47Z","timestamp":1556137127000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45066-1_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405054","9783540450665"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-45066-1_22","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]}}}