{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:31:54Z","timestamp":1743006714680,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030218027"},{"type":"electronic","value":"9783030218034"}],"license":[{"start":{"date-parts":[[2019,6,15]],"date-time":"2019-06-15T00:00:00Z","timestamp":1560556800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-21803-4_46","type":"book-chapter","created":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T22:03:24Z","timestamp":1560549804000},"page":"458-467","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Reversed Search Maximum Clique Algorithm Based on Recoloring"],"prefix":"10.1007","author":[{"given":"Deniss","family":"Kumlander","sequence":"first","affiliation":[]},{"given":"Aleksandr","family":"Poro\u0161in","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,15]]},"reference":[{"key":"46_CR1","volume-title":"Computers and Intractability: A Guide to the Theory of Np-Completeness","author":"MR Garey","year":"2003","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of Np-Completeness. Freeman, New York (2003)"},{"key":"46_CR2","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem proving procedures. In: Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, pp. 151\u2013158 (1971)","DOI":"10.1145\/800157.805047"},{"key":"46_CR3","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. Oper. Res. Lett. 9, 375\u2013382 (1990)","journal-title":"Oper. Res. Lett."},{"key":"46_CR4","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0166-218X(01)00290-6","volume":"120","author":"PRJ \u00d6sterg\u00e5rd","year":"2002","unstructured":"\u00d6sterg\u00e5rd, P.R.J.: A fast algorithm for the maximum clique problem. Discret. Appl. Math. 120, 197\u2013207 (2002)","journal-title":"Discret. Appl. Math."},{"key":"46_CR5","volume-title":"Some Practical Algorithms to Solve the Maximum Clique Problem","author":"D Kumlander","year":"2005","unstructured":"Kumlander, D.: Some Practical Algorithms to Solve the Maximum Clique Problem. Tallinn University of Technology, Tallinn (2005)"},{"issue":"1","key":"46_CR6","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0020-0190(83)90007-8","volume":"16","author":"K Clarkson","year":"1983","unstructured":"Clarkson, K.: A modification to the greedy algorithm for vertex cover. Inf. Process. Lett. 16(1), 23\u201325 (1983)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"46_CR7","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1007\/s10732-012-9196-4","volume":"18","author":"DV Andrade","year":"2012","unstructured":"Andrade, D.V., Resende, M.G.C., Werneck, R.F.: Fast local search for the maximum independent set problem. J. Heuristics 18(4), 525\u2013547 (2012)","journal-title":"J. Heuristics"},{"key":"46_CR8","doi-asserted-by":"crossref","unstructured":"Tomita, E., Seki, T.: An efficient branch-and-bound algorithm for finding a maximum clique. In: Proceedings of the 4th International Conference on Discrete Mathematics and Theoretical Computer Science, DMTCS\u201903. Springer-Verlag, Berlin, Heidelberg, pp. 278\u2013289 (2003)","DOI":"10.1007\/3-540-45066-1_22"},{"issue":"1","key":"46_CR9","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s10898-006-9039-7","volume":"37","author":"E Tomita","year":"2007","unstructured":"Tomita, E., Kameda, T.: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments. J. Glob. Optim. 37(1), 95\u2013111 (2007)","journal-title":"J. Glob. Optim."},{"key":"46_CR10","doi-asserted-by":"crossref","unstructured":"Tomita, E., Sutani, Y., Higashi, T., Takahashi, S., Wakatsuki, M.: A simple and faster branch-and-bound algorithm for finding a maximum clique. In: Proceedings of the 4th International Conference on Algorithms and Computation, WALCOM\u201910. Springer-Verlag, Berlin, Heidelberg, pp. 191\u2013203 (2010)","DOI":"10.1007\/978-3-642-11440-3_18"},{"key":"46_CR11","doi-asserted-by":"crossref","unstructured":"Batsyn, M., Goldengorin, B., Maslov, E., Pardalos, P.M.: Improvements to MCS Algorithm for the Maximum Clique Problem. Springer Science+Business Media, New York (2013)","DOI":"10.1007\/s10878-012-9592-6"}],"container-title":["Advances in Intelligent Systems and Computing","Optimization of Complex Systems: Theory, Models, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-21803-4_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T05:49:19Z","timestamp":1572587359000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-21803-4_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,15]]},"ISBN":["9783030218027","9783030218034"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21803-4_46","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2019,6,15]]},"assertion":[{"value":"15 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WCGO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"World Congress on Global Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Metz","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wcgo2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}