{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T02:25:35Z","timestamp":1773109535798,"version":"3.50.1"},"publisher-location":"Cham","reference-count":54,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319449524","type":"print"},{"value":"9783319449531","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","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":[[2016]]},"DOI":"10.1007\/978-3-319-44953-1_23","type":"book-chapter","created":{"date-parts":[[2016,8,22]],"date-time":"2016-08-22T11:12:23Z","timestamp":1471864343000},"page":"350-368","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Clique and Constraint Models for Maximum Common (Connected) Subgraph Problems"],"prefix":"10.1007","author":[{"given":"Ciaran","family":"McCreesh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samba Ndojh","family":"Ndiaye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Prosser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christine","family":"Solnon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,23]]},"reference":[{"issue":"1","key":"23_CR1","doi-asserted-by":"publisher","first-page":"119","DOI":"10.3390\/a6010119","volume":"6","author":"T Akutsu","year":"2013","unstructured":"Akutsu, T., Tamura, T.: A polynomial-time algorithm for computing the maximum common connected edge subgraph of outerplanar graphs of bounded degree. Algorithms 6(1), 119\u2013135 (2013). \n                      http:\/\/dx.doi.org\/10.3390\/a6010119","journal-title":"Algorithms"},{"issue":"4","key":"23_CR2","doi-asserted-by":"publisher","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. Comput. 15(4), 1054\u20131068 (1986)","journal-title":"SIAM J. Comput."},{"issue":"9","key":"23_CR3","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1957","unstructured":"Bron, C., Kerbosch, J.: Algorithm 457: finding all cliques of an undirected graph. Commun. ACM 16(9), 575\u2013577 (1957). \n                      http:\/\/doi.acm.org\/10.1145\/362342.362367","journal-title":"Commun. ACM"},{"key":"23_CR4","unstructured":"Brown, K.N., Prosser, P., Beck, C.J., Wu, C.W.: Exploring the use of constraint programming for enforcing connectivity during graph generation. In: Proceedings IJCAI Workshop on Modelling and Solving Problems with Constraints, Edinburgh, Scotland, pp. 26\u201331 (2005)"},{"issue":"8","key":"23_CR5","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1016\/S0167-8655(97)00060-3","volume":"18","author":"H Bunke","year":"1997","unstructured":"Bunke, H.: On a relation between graph edit distance and maximum common subgraph. Pattern Recogn. Lett. 18(8), 689\u2013694 (1997). \n                      http:\/\/dx.doi.org\/10.1016\/S0167-8655(97)00060-3","journal-title":"Pattern Recogn. Lett."},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/3-540-70659-3_12","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"H Bunke","year":"2002","unstructured":"Bunke, H., Foggia, P., Guidobaldi, C., Sansone, C., Vento, M.: A comparison of algorithms for maximum common subgraph on randomly connected graphs. In: Caelli, T.M., Amin, A., Duin, R.P.W., Kamel, M.S., de Ridder, D. (eds.) SPR 2002 and SSPR 2002. LNCS, vol. 2396, pp. 123\u2013132. Springer, Heidelberg (2002). \n                      http:\/\/dx.doi.org\/10.1007\/3-540-70659-3_12"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-642-38221-5_16","volume-title":"Graph-Based Representations in Pattern Recognition","author":"C Combier","year":"2013","unstructured":"Combier, C., Damiand, G., Solnon, C.: Map edit distance vs. graph edit distance for matching images. In: Kropatsch, W.G., Artner, N.M., Haxhimusa, Y., Jiang, X. (eds.) GbRPR 2013. LNCS, vol. 7877, pp. 152\u2013161. Springer, Heidelberg (2013)"},{"issue":"1","key":"23_CR8","doi-asserted-by":"publisher","first-page":"99","DOI":"10.7155\/jgaa.00139","volume":"11","author":"D Conte","year":"2007","unstructured":"Conte, D., Foggia, P., Vento, M.: Challenging complexity of maximum common subgraph detection algorithms: a performance analysis of three algorithms on a wide database of graphs. J. Graph Algorithms Appl. 11(1), 99\u2013143 (2007). \n                      http:\/\/jgaa.info\/accepted\/2007\/ConteFoggiaVento2007.11.1.pdf","journal-title":"J. Graph Algorithms Appl."},{"key":"23_CR9","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1613\/jair.43","volume":"1","author":"DJ Cook","year":"1994","unstructured":"Cook, D.J., Holder, L.B.: Substructure discovery using minimum description length and background knowledge. J. Artif. Intell. Res. (JAIR) 1, 231\u2013255 (1994). \n                      http:\/\/dx.doi.org\/10.1613\/jair.43","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"issue":"9","key":"23_CR10","doi-asserted-by":"publisher","first-page":"2217","DOI":"10.1021\/ci4002525","volume":"53","author":"M Depolli","year":"2013","unstructured":"Depolli, M., Konc, J., Rozman, K., Trobec, R., Janezic, D.: Exact parallel maximum clique algorithm for general and protein graphs. J. Chem. Inf. Model. 53(9), 2217\u20132228 (2013). \n                      http:\/\/dx.doi.org\/10.1021\/ci4002525","journal-title":"J. Chem. Inf. Model."},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"Learning and Intelligent Optimization","year":"2015","unstructured":"Dhaenens, C., Jourdan, L., Marmion, M. (eds.): Learning and Intelligent Optimization. LNCS, vol. 8994. Springer, Switzerland (2015). \n                      http:\/\/dx.doi.org\/10.1007\/978-3-319-19084-6"},{"issue":"4","key":"23_CR12","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1109\/69.617051","volume":"9","author":"S Djoko","year":"1997","unstructured":"Djoko, S., Cook, D.J., Holder, L.B.: An empirical study of domain knowledge and its benefits to substructure discovery. IEEE Trans. Knowl. Data Eng. 9(4), 575\u2013586 (1997). \n                      http:\/\/dx.doi.org\/10.1109\/69.617051","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"23_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/11564751_18","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"G Dooms","year":"2005","unstructured":"Dooms, G., Deville, Y., Dupont, P.E.: CP(Graph): introducing a graph computation domain in constraint programming. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 211\u2013225. Springer, Heidelberg (2005). \n                      http:\/\/dx.doi.org\/10.1007\/11564751_18"},{"key":"23_CR14","unstructured":"Droschinsky, A., Kriege, N., Mutzel, P.: Faster algorithms for the maximum common subtree isomorphism problem. In: Faliszewski, P., Muscholl, A., Niedermeier, R. (eds.) 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), vol. 58, pp. 34:1\u201334:14. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2016, to appear)"},{"issue":"17","key":"23_CR15","first-page":"1","volume":"2","author":"PJ Durand","year":"1999","unstructured":"Durand, P.J., Pasari, R., Baker, J.W., Tsai, C.C.: An efficient algorithm for similarity analysis of molecules. Internet J. Chem. 2(17), 1\u201316 (1999)","journal-title":"Internet J. Chem."},{"issue":"1","key":"23_CR16","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1002\/wcms.5","volume":"1","author":"HC Ehrlich","year":"2011","unstructured":"Ehrlich, H.C., Rarey, M.: Maximum common subgraph isomorphism algorithms and their applications in molecular science: a review. Wiley Interdisc. Rev. Comput. Mol. Sci. 1(1), 68\u201379 (2011). \n                      http:\/\/dx.doi.org\/10.1002\/wcms.5","journal-title":"Wiley Interdisc. Rev. Comput. Mol. Sci."},{"issue":"5","key":"23_CR17","doi-asserted-by":"publisher","first-page":"941","DOI":"10.1021\/acs.jcim.5b00036","volume":"55","author":"P Englert","year":"2015","unstructured":"Englert, P., Kov\u00e1cs, P.: Efficient heuristics for maximum common substructure search. J. Chem. Inf. Model. 55(5), 941\u2013955 (2015). \n                      http:\/\/dx.doi.org\/10.1021\/acs.jcim.5b00036","journal-title":"J. Chem. Inf. Model."},{"issue":"6\/7","key":"23_CR18","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1016\/S0167-8655(01)00017-4","volume":"22","author":"M Fern\u00e1ndez","year":"2001","unstructured":"Fern\u00e1ndez, M., Valiente, G.: A graph distance metric combining maximum common subgraph and minimum common supergraph. Pattern Recogn. Lett. 22(6\/7), 753\u2013758 (2001)","journal-title":"Pattern Recogn. Lett."},{"key":"23_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-540-88625-9_16","volume-title":"Information and Communications Security","author":"D Gao","year":"2008","unstructured":"Gao, D., Reiter, M.K., Song, D.: BinHunt: automatically finding semantic differences in binary programs. In: Chen, L., Ryan, M.D., Wang, G. (eds.) ICICS 2008. LNCS, vol. 5308, pp. 238\u2013255. Springer, Heidelberg (2008). \n                      http:\/\/dx.doi.org\/10.1007\/978-3-540-88625-9_16"},{"key":"23_CR20","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.dam.2013.08.008","volume":"162","author":"S Gay","year":"2014","unstructured":"Gay, S., Fages, F., Martinez, T., Soliman, S., Solnon, C.: On the subgraph epimorphism problem. Discrete Appl. Math. 162, 214\u2013228 (2014). \n                      http:\/\/dx.doi.org\/10.1016\/j.dam.2013.08.008","journal-title":"Discrete Appl. Math."},{"key":"23_CR21","unstructured":"J\u00e9gou, P.: Decomposition of domains based on the micro-structure of finite constraint-satisfaction problems. In: Fikes, R., Lehnert, W.G. (eds.) Proceedings of the 11th National Conference on Artificial Intelligence, Washington, DC, USA, pp. 731\u2013736. AAAI Press\/The MIT Press, 11\u201315 July 1993. \n                      http:\/\/www.aaai.org\/Library\/AAAI\/1993\/aaai93-109.php"},{"issue":"1\u20132","key":"23_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(00)00286-3","volume":"250","author":"I Koch","year":"2001","unstructured":"Koch, I.: Enumerating all connected maximal common subgraphs in two graphs. Theor. Comput. Sci. 250(1\u20132), 1\u201330 (2001). \n                      http:\/\/dx.doi.org\/10.1016\/S0304-3975(00)00286-3","journal-title":"Theor. Comput. Sci."},{"key":"23_CR23","unstructured":"Kriege, N.: Comparing graphs. Ph.d. thesis, Technische Universit\u00e4t Dortmund (2015)"},{"issue":"4","key":"23_CR24","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/BF02575586","volume":"9","author":"G Levi","year":"1973","unstructured":"Levi, G.: A note on the derivation of maximal common subgraphs of two directed or undirected graphs. CALCOLO 9(4), 341\u2013352 (1973). \n                      http:\/\/dx.doi.org\/10.1007\/BF02575586","journal-title":"CALCOLO"},{"key":"23_CR25","doi-asserted-by":"crossref","unstructured":"Li, C., Fang, Z., Xu, K.: Combining MaxSAT reasoning and incremental upper bound for the maximum clique problem. In: 2013 IEEE 25th International Conference on Tools with Artificial Intelligence, Herndon, VA, USA, pp. 939\u2013946. IEEE Computer Society, 4\u20136 November 2013. \n                      http:\/\/dx.doi.org\/10.1109\/ICTAI.2013.143","DOI":"10.1109\/ICTAI.2013.143"},{"key":"23_CR26","doi-asserted-by":"crossref","unstructured":"Li, C., Jiang, H., Xu, R.: Incremental MaxSAT reasoning to reduce branches in a branch-and-bound algorithm for MaxClique. In: Dhaenens et al. [11], pp. 268\u2013274. \n                      http:\/\/dx.doi.org\/10.1007\/978-3-319-19084-6_26","DOI":"10.1007\/978-3-319-19084-6_26"},{"issue":"7","key":"23_CR27","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1016\/0031-3203(91)90029-5","volume":"24","author":"SW Lu","year":"1991","unstructured":"Lu, S.W., Ren, Y., Suen, C.Y.: Hierarchical attributed graph representation and recognition of handwritten chinese characters. Pattern Recogn. 24(7), 617\u2013632 (1991). \n                      http:\/\/www.sciencedirect.com\/science\/article\/pii\/0031320391900295","journal-title":"Pattern Recogn."},{"issue":"4","key":"23_CR28","doi-asserted-by":"publisher","first-page":"618","DOI":"10.3390\/a6040618","volume":"6","author":"C McCreesh","year":"2013","unstructured":"McCreesh, C., Prosser, P.: Multi-threading a state-of-the-art maximum clique algorithm. Algorithms 6(4), 618\u2013635 (2013). \n                      http:\/\/dx.doi.org\/10.3390\/a6040618","journal-title":"Algorithms"},{"key":"23_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/978-3-319-10428-7_40","volume-title":"Principles and Practice of Constraint Programming","author":"C McCreesh","year":"2014","unstructured":"McCreesh, C., Prosser, P.: Reducing the branching in a branch and bound algorithm for the maximum clique problem. In: O\u2019Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 549\u2013563. Springer, Heidelberg (2014). \n                      http:\/\/dx.doi.org\/10.1007\/978-3-319-10428-7_40"},{"issue":"1","key":"23_CR30","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1145\/2742359","volume":"2","author":"C McCreesh","year":"2015","unstructured":"McCreesh, C., Prosser, P.: The shape of the search tree for the maximum clique problem and the implications for parallel branch and bound. TOPC 2(1), 8 (2015). \n                      http:\/\/doi.acm.org\/10.1145\/2742359","journal-title":"TOPC"},{"key":"23_CR31","unstructured":"McCreesh, C., Prosser, P., Trimble, J.: Heuristics and really hard instances for subgraph isomorphism problems. In: Proceedings of the 25th International Joint Conference on Artificial Intelligence (2016, to appear)"},{"issue":"1","key":"23_CR32","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1002\/spe.4380120103","volume":"12","author":"JJ McGregor","year":"1982","unstructured":"McGregor, J.J.: Backtrack search algorithms and the maximal common subgraph problem. Softw. Pract. Exp. 12(1), 23\u201334 (1982)","journal-title":"Softw. Pract. Exp."},{"key":"23_CR33","doi-asserted-by":"crossref","unstructured":"Minot, M., Ndiaye, S.N., Solnon, C.: A comparison of decomposition methods for the maximum common subgraph problem. In: 27th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2015, Vietri sul Mare, Italy, pp. 461\u2013468. IEEE, 9\u201311 November 2015. \n                      http:\/\/dx.doi.org\/10.1109\/ICTAI.2015.75","DOI":"10.1109\/ICTAI.2015.75"},{"key":"23_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/978-3-642-23786-7_48","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2011","author":"SN Ndiaye","year":"2011","unstructured":"Ndiaye, S.N., Solnon, C.: CP models for maximum common subgraph problems. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, pp. 637\u2013644. Springer, Heidelberg (2011). \n                      http:\/\/dx.doi.org\/10.1007\/978-3-642-23786-7_48"},{"key":"23_CR35","doi-asserted-by":"crossref","unstructured":"Nikolaev, A., Batsyn, M., Segundo, P.S.: Reusing the same coloring in the child nodes of the search tree for the maximum clique problem. In: Dhaenens et al. [11], pp. 275\u2013280. \n                      http:\/\/dx.doi.org\/10.1007\/978-3-319-19084-6_27","DOI":"10.1007\/978-3-319-19084-6_27"},{"key":"23_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/3-540-45578-7_31","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"T Petit","year":"2001","unstructured":"Petit, T., R\u00e9gin, J.-C., Bessi\u00e8re, C.: Specific filtering algorithms for over-constrained problems. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 451\u2013463. Springer, Heidelberg (2001). \n                      http:\/\/dx.doi.org\/10.1007\/s10479-011-1019-8"},{"issue":"1","key":"23_CR37","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s10479-011-1019-8","volume":"199","author":"B Piva","year":"2012","unstructured":"Piva, B., de Souza, C.C.: Polyhedral study of the maximum common induced subgraph problem. Ann. OR 199(1), 77\u2013102 (2012). \n                      http:\/\/dx.doi.org\/10.1007\/s10479-011-1019-8","journal-title":"Ann. OR"},{"issue":"4","key":"23_CR38","doi-asserted-by":"publisher","first-page":"545","DOI":"10.3390\/a5040545","volume":"5","author":"P Prosser","year":"2012","unstructured":"Prosser, P.: Exact algorithms for maximum clique: a computational study. Algorithms 5(4), 545\u2013587 (2012). \n                      http:\/\/dx.doi.org\/10.3390\/a5040545","journal-title":"Algorithms"},{"key":"23_CR39","unstructured":"Prosser, P., Unsworth, C.: A connectivity constraint using bridges. In: Brewka, G., Coradeschi, S., Perini, A., Traverso, P. (eds.) Proceedings of the 17th European Conference on Artificial Intelligence, ECAI 2006. Frontiers in Artificial Intelligence and Applications, vol. 141, August 29\u2013September 1, 2006, Riva del Garda, Italy, Including Prestigious Applications of Intelligent Systems (PAIS), pp. 707\u2013708. IOS Press (2006)"},{"issue":"7","key":"23_CR40","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1023\/A:1021271615909","volume":"16","author":"JW Raymond","year":"2002","unstructured":"Raymond, J.W., Willett, P.: Maximum common subgraph isomorphism algorithms for the matching of chemical structures. J. Comput. Aided Mol. Des. 16(7), 521\u2013533 (2002). \n                      http:\/\/dx.doi.org\/10.1023\/A:1021271615909","journal-title":"J. Comput. Aided Mol. Des."},{"key":"23_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/3-540-58601-6_86","volume-title":"Principles and Practice of Constraint Programming","author":"D Sabin","year":"1994","unstructured":"Sabin, D., Freuder, E.C.: Contradicting conventional wisdom in constraint satisfaction. In: Borning, A. (ed.) PPCP 1994. LNCS, vol. 874, pp. 10\u201320. Springer, Heidelberg (1994)"},{"issue":"8","key":"23_CR42","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1016\/S0167-8655(02)00253-2","volume":"24","author":"MD Santo","year":"2003","unstructured":"Santo, M.D., Foggia, P., Sansone, C., Vento, M.: A large database of graphs and its use for benchmarking graph isomorphism algorithms. Pattern Recogn. Lett. 24(8), 1067\u20131079 (2003). \n                      http:\/\/dx.doi.org\/10.1016\/S0167-8655(02)00253-2","journal-title":"Pattern Recogn. Lett."},{"key":"23_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/978-3-319-09584-4_12","volume-title":"Learning and Intelligent Optimization","author":"PS Segundo","year":"2014","unstructured":"Segundo, P.S., Lopez, A., Batsyn, M.: Initial sorting of vertices in the maximum clique problem reviewed. In: Pardalos, P.M., Resende, M.G.C., Vogiatzis, C., Walteros, J.L. (eds.) LION 2014. LNCS, vol. 8426, pp. 111\u2013120. Springer, Switzerland (2014). \n                      http:\/\/dx.doi.org\/10.1007\/978-3-319-09584-4_12"},{"key":"23_CR44","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.cor.2015.07.013","volume":"66","author":"PS Segundo","year":"2016","unstructured":"Segundo, P.S., Lopez, A., Pardalos, P.M.: A new exact maximum clique algorithm for large and massive sparse graphs. Comput. OR 66, 81\u201394 (2016). \n                      http:\/\/dx.doi.org\/10.1016\/j.cor.2015.07.013","journal-title":"Comput. OR"},{"issue":"3","key":"23_CR45","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/s11590-011-0431-y","volume":"7","author":"PS Segundo","year":"2013","unstructured":"Segundo, P.S., Mat\u00eda, F., Rodr\u00edguez-Losada, D., Hernando, M.: An improved bit parallel exact maximum clique algorithm. Optim. Lett. 7(3), 467\u2013479 (2013). \n                      http:\/\/dx.doi.org\/10.1007\/s11590-011-0431-y","journal-title":"Optim. Lett."},{"key":"23_CR46","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.cor.2015.06.009","volume":"64","author":"PS Segundo","year":"2015","unstructured":"Segundo, P.S., Nikolaev, A., Batsyn, M.: Infra-chromatic bound for exact maximum clique search. Comput. OR 64, 293\u2013303 (2015). \n                      http:\/\/dx.doi.org\/10.1016\/j.cor.2015.06.009","journal-title":"Comput. OR"},{"issue":"2","key":"23_CR47","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1016\/j.cor.2010.07.019","volume":"38","author":"PS Segundo","year":"2011","unstructured":"Segundo, P.S., Rodr\u00edguez-Losada, D., Jim\u00e9nez, A.: An exact bit-parallel algorithm for the maximum clique problem. Comput. OR 38(2), 571\u2013581 (2011). \n                      http:\/\/dx.doi.org\/10.1016\/j.cor.2010.07.019","journal-title":"Comput. OR"},{"key":"23_CR48","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.cor.2013.10.018","volume":"44","author":"PS Segundo","year":"2014","unstructured":"Segundo, P.S., Tapia, C.: Relaxed approximate coloring in exact maximum clique search. Comput. OR 44, 185\u2013192 (2014). \n                      http:\/\/dx.doi.org\/10.1016\/j.cor.2013.10.018","journal-title":"Comput. OR"},{"key":"23_CR49","unstructured":"Shasha, D., Wang, J.T.L., Giugno, R.: Algorithmics and applications of tree and graph searching. In: Proceedings of the Twenty-first ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2002, NY, USA, pp. 39\u201352 (2002). \n                      http:\/\/doi.acm.org\/10.1145\/543613.543620"},{"key":"23_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/11533719_73","volume-title":"Computing and Combinatorics","author":"WH Suters","year":"2005","unstructured":"Suters, W.H., Abu-Khzam, F.N., Zhang, Y., Symons, C.T., Samatova, N.F., Langston, M.A.: A new approach and faster exact methods for the maximum common subgraph problem. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 717\u2013727. Springer, Heidelberg (2005). \n                      http:\/\/dx.doi.org\/10.1007\/11533719_73"},{"issue":"1","key":"23_CR51","doi-asserted-by":"publisher","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. Global Optim. 37(1), 95\u2013111 (2007). \n                      http:\/\/dx.doi.org\/10.1007\/s10898-006-9039-7","journal-title":"J. Global Optim."},{"key":"23_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45066-1_22","volume-title":"Discrete Mathematics and Theoretical Computer Science","author":"E Tomita","year":"2003","unstructured":"Tomita, E., Seki, T.: An efficient branch-and-bound algorithm for finding a maximum clique. In: Calude, C.S., Dinneen, M.J., Vajnovszki, V. (eds.) DMTCS 2003. LNCS, vol. 2731. Springer, Heidelberg (2003). \n                      http:\/\/dx.doi.org\/10.1007\/3-540-45066-1_22"},{"key":"23_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-642-11440-3_18","volume-title":"WALCOM: Algorithms and Computation","author":"E Tomita","year":"2010","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: Rahman, M.S., Fujita, S. (eds.) WALCOM 2010. LNCS, vol. 5942, pp. 191\u2013203. Springer, Heidelberg (2010). \n                      http:\/\/dx.doi.org\/10.1007\/978-3-642-11440-3_18"},{"key":"23_CR54","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/978-3-540-87477-5_39","volume-title":"Modelling, Computation and Optimization in Information Systems and Management Sciences","author":"P Vismara","year":"2008","unstructured":"Vismara, P., Valery, B.: Finding maximum common connected subgraphs using clique detection or constraint satisfaction algorithms. In: An, L.T.H., Bouvry, P., Tao, P.D. (eds.) MCO 2008. CCIS, vol. 14, pp. 358\u2013368. Springer, Heidelberg (2008). \n                      http:\/\/dx.doi.org\/10.1007\/978-3-540-87477-5_39"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44953-1_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T00:55:15Z","timestamp":1558313715000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44953-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319449524","9783319449531"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44953-1_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"23 August 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Principles and Practice of Constraint Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toulouse","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":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cp2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}