{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:15:15Z","timestamp":1743110115649,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319930305"},{"type":"electronic","value":"9783319930312"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-93031-2_22","type":"book-chapter","created":{"date-parts":[[2018,6,7]],"date-time":"2018-06-07T06:04:24Z","timestamp":1528351464000},"page":"298-315","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Observations from Parallelising Three Maximum Common (Connected) Subgraph Algorithms"],"prefix":"10.1007","author":[{"given":"Ruth","family":"Hoffmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ciaran","family":"McCreesh","sequence":"additional","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":"Craig","family":"Reilly","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christine","family":"Solnon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Trimble","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,8]]},"reference":[{"key":"22_CR1","series-title":"International Series in Operations Research & Management","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/0-387-22827-6_5","volume-title":"Tutorials on Emerging Methodologies and Applications in Operations Research","author":"DA Bader","year":"2005","unstructured":"Bader, D.A., Hart, W.E., Phillips, C.A.: Parallel algorithm design for branch and bound. In: Greenberg, H.J. (ed.) Tutorials on Emerging Methodologies and Applications in Operations Research. ISOR, vol. 76, pp. 1\u201344. Springer, New York (2005). https:\/\/doi.org\/10.1007\/0-387-22827-6_5"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/3-540-60321-2_29","volume-title":"Parallel Algorithms for Irregularly Structured Problems","author":"A de Bruin","year":"1995","unstructured":"de Bruin, A., Kindervater, G.A.P., Trienekens, H.W.J.M.: Asynchronous parallel branch and bound and anomalies. In: Ferreira, A., Rolim, J. (eds.) IRREGULAR 1995. LNCS, vol. 980, pp. 363\u2013377. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60321-2_29"},{"issue":"8","key":"22_CR3","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)","journal-title":"Pattern Recogn. Lett."},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-642-04244-7_20","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"G Chu","year":"2009","unstructured":"Chu, G., Schulte, C., Stuckey, P.J.: Confidence-based work stealing in parallel constraint programming. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 226\u2013241. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04244-7_20"},{"key":"22_CR5","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). https:\/\/doi.org\/10.1007\/978-3-642-38221-5_16"},{"issue":"1","key":"22_CR6","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)","journal-title":"J. Graph Algorithms Appl."},{"key":"22_CR7","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. 1, 231\u2013255 (1994)","journal-title":"J. Artif. Intell. Res."},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-319-22527-2_8","volume-title":"Fusion Methodologies in Crisis Management","author":"T Delavallade","year":"2016","unstructured":"Delavallade, T., Fossier, S., Laudy, C., Lortal, G.: On the challenges of using social media for crisis management. In: Rogova, G., Scott, P. (eds.) Fusion Methodologies in Crisis Management, pp. 137\u2013175. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-22527-2_8"},{"issue":"2","key":"22_CR9","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2), 201\u2013213 (2002)","journal-title":"Math. Program."},{"issue":"1","key":"22_CR10","first-page":"68","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)","journal-title":"Wiley Interdisc. Rev.: Comput. Mol. Sci."},{"issue":"9","key":"22_CR11","doi-asserted-by":"publisher","first-page":"2536","DOI":"10.1109\/TKDE.2015.2413789","volume":"27","author":"M Fang","year":"2015","unstructured":"Fang, M., Yin, J., Zhu, X., Zhang, C.: Trgraph: cross-network transfer learning via common signature subgraphs. IEEE Trans. Knowl. Data Eng. 27(9), 2536\u20132549 (2015)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"6\/7","key":"22_CR12","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":"22_CR13","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). https:\/\/doi.org\/10.1007\/978-3-540-88625-9_16"},{"key":"22_CR14","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. Discret. Appl. Math. 162, 214\u2013228 (2014)","journal-title":"Discret. Appl. Math."},{"key":"22_CR15","unstructured":"Harvey, W.D., Ginsberg, M.L.: Limited discrepancy search. In: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI 95, Montr\u00e9al Qu\u00e9bec, Canada, 20\u201325 August 1995, vol. 2, pp. 607\u2013615. Morgan Kaufmann (1995)"},{"key":"22_CR16","unstructured":"Hoffmann, R., McCreesh, C., Reilly, C.: Between subgraph isomorphism and maximum common subgraph. In: Singh, S.P., Markovitch, S. (eds.) Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 4\u20139 February 2017, San Francisco, California, USA, pp. 3907\u20133914. AAAI Press (2017)"},{"key":"22_CR17","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, 11\u201315 July 1993, pp. 731\u2013736. AAAI Press\/The MIT Press (1993)"},{"key":"22_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-319-50349-3_8","volume-title":"Learning and Intelligent Optimization","author":"L Kotthoff","year":"2016","unstructured":"Kotthoff, L., McCreesh, C., Solnon, C.: Portfolios of subgraph isomorphism algorithms. In: Festa, P., Sellmann, M., Vanschoren, J. (eds.) LION 2016. LNCS, vol. 10079, pp. 107\u2013122. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50349-3_8"},{"key":"22_CR19","unstructured":"Kriege, N.: Comparing graphs. Ph.D. thesis, Technische Universit\u00e4t Dortmund (2015)"},{"issue":"6","key":"22_CR20","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1145\/358080.358103","volume":"27","author":"T Lai","year":"1984","unstructured":"Lai, T., Sahni, S.: Anomalies in parallel branch-and-bound algorithms. Commun. ACM 27(6), 594\u2013602 (1984)","journal-title":"Commun. ACM"},{"issue":"4","key":"22_CR21","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)","journal-title":"CALCOLO"},{"issue":"6","key":"22_CR22","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1109\/TC.1986.5009434","volume":"35","author":"G Li","year":"1986","unstructured":"Li, G., Wah, B.W.: Coping with anomalies in parallel branch-and-bound algorithms. IEEE Trans. Comput. 35(6), 568\u2013573 (1986)","journal-title":"IEEE Trans. Comput."},{"issue":"99","key":"22_CR23","first-page":"1","volume":"PP","author":"C Luo","year":"2017","unstructured":"Luo, C., Wang, X., Su, C., Ni, Z.: A fixture design retrieving method based on constrained maximum common subgraph. IEEE Trans. Autom. Sci. Eng. PP(99), 1\u201313 (2017)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"22_CR24","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1613\/jair.5247","volume":"57","author":"A Malapert","year":"2016","unstructured":"Malapert, A., R\u00e9gin, J., Rezgui, M.: Embarrassingly parallel search in constraint programming. J. Artif. Intell. Res. 57, 421\u2013464 (2016)","journal-title":"J. Artif. Intell. Res."},{"key":"22_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-319-44953-1_23","volume-title":"Principles and Practice of Constraint Programming","author":"C McCreesh","year":"2016","unstructured":"McCreesh, C., Ndiaye, S.N., Prosser, P., Solnon, C.: Clique and constraint models for maximum common (connected) subgraph problems. In: Rueher, M. (ed.) CP 2016. LNCS, vol. 9892, pp. 350\u2013368. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44953-1_23"},{"key":"22_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-319-23219-5_21","volume-title":"Principles and Practice of Constraint Programming","author":"C McCreesh","year":"2015","unstructured":"McCreesh, C., Prosser, P.: A parallel, backjumping subgraph isomorphism algorithm using supplemental graphs. In: Pesant, G. (ed.) CP 2015. LNCS, vol. 9255, pp. 295\u2013312. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23219-5_21"},{"issue":"1","key":"22_CR27","doi-asserted-by":"publisher","first-page":"8:1","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:1\u20138:27 (2015)","journal-title":"TOPC"},{"key":"22_CR28","doi-asserted-by":"crossref","unstructured":"McCreesh, C., Prosser, P., Trimble, J.: A partitioning algorithm for maximum common subgraph problems. In: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, 19\u201325 August 2017 (2017, to appear)","DOI":"10.24963\/ijcai.2017\/99"},{"key":"22_CR29","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, 9\u201311 November 2015, pp. 461\u2013468. IEEE Computer Society (2015)","DOI":"10.1109\/ICTAI.2015.75"},{"key":"22_CR30","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). https:\/\/doi.org\/10.1007\/978-3-642-23786-7_48"},{"key":"22_CR31","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1016\/j.cose.2013.09.006","volume":"39","author":"YH Park","year":"2013","unstructured":"Park, Y.H., Reeves, D.S., Stamp, M.: Deriving common malware behavior through graph clustering. Comput. Secur. 39, 419\u2013430 (2013)","journal-title":"Comput. Secur."},{"key":"22_CR32","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 \u2014 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). https:\/\/doi.org\/10.1007\/3-540-45578-7_31"},{"issue":"7","key":"22_CR33","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)","journal-title":"J. Comput. Aided Mol. Des."},{"issue":"8","key":"22_CR34","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)","journal-title":"Pattern Recogn. Lett."},{"issue":"3","key":"22_CR35","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)","journal-title":"Optim. Lett."},{"key":"22_CR36","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: Le Thi, H.A., Bouvry, P., Pham Dinh, T. (eds.) MCO 2008. CCIS, vol. 14, pp. 358\u2013368. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87477-5_39"},{"key":"22_CR37","unstructured":"Xu, L., Hoos, H., Leyton-Brown, K.: Hydra: automatically configuring algorithms for portfolio-based selection. In: Fox, M., Poole, D. (eds.) Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2010, Atlanta, Georgia, USA, 11\u201315 July 2010. AAAI Press (2010)"}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-93031-2_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:28:41Z","timestamp":1709832521000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-93031-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319930305","9783319930312"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-93031-2_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"8 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Delft","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/cpaior2018\/home","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}