{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T07:36:38Z","timestamp":1772264198376,"version":"3.50.1"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030513719","type":"print"},{"value":"9783030513726","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-51372-6_19","type":"book-chapter","created":{"date-parts":[[2020,6,25]],"date-time":"2020-06-25T00:15:38Z","timestamp":1593044138000},"page":"316-324","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":36,"title":["The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6106-4871","authenticated-orcid":false,"given":"Ciaran","family":"McCreesh","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4460-6912","authenticated-orcid":false,"given":"Patrick","family":"Prosser","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7282-8745","authenticated-orcid":false,"given":"James","family":"Trimble","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,23]]},"reference":[{"issue":"13","key":"19_CR1","first-page":"i241","volume":"24","author":"N Alon","year":"2008","unstructured":"Alon, N., Dao, P., Hajirasouliha, I., Hormozdiari, F., Sahinalp, S.C.: Biomolecular network motif counting and discovery by color coding. Bioinformatics (Oxford, England) 24(13), i241\u2013i249 (2008)","journal-title":"Bioinformatics (Oxford, England)"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Archibald, B., Calder, M., Sevegnani, M.: Conditional bigraphs. In: 13th International Conference on Graph Transformation (ICGT 2020), Bergen, Norway, 25\u201326 June 2020 (2020)","DOI":"10.1007\/978-3-030-51372-6_1"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-030-19212-9_2","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"B Archibald","year":"2019","unstructured":"Archibald, B., Dunlop, F., Hoffmann, R., McCreesh, C., Prosser, P., Trimble, J.: Sequential and parallel solution-biased search for subgraph algorithms. In: Rousseau, L.-M., Stergiou, K. (eds.) CPAIOR 2019. LNCS, vol. 11494, pp. 20\u201338. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-19212-9_2"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-319-10428-7_12","volume-title":"Principles and Practice of Constraint Programming, CP 2014","author":"G Audemard","year":"2014","unstructured":"Audemard, G., Lecoutre, C., Samy-Modeliar, M., Goncalves, G., Porumbel, D.: Scoring-based neighborhood dominance for the subgraph isomorphism problem. In: O\u2019Sullivan, B. (ed.) Principles and Practice of Constraint Programming, CP 2014. Lecture Notes in Computer Science, vol. 8656, pp. 125\u2013141. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10428-7_12"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Blindell, G.H., Lozano, R.C., Carlsson, M., Schulte, C.: Modeling universal instruction selection. In: Proceedings of Principles and Practice of Constraint Programming - 21st International Conference, CP 2015, Cork, Ireland, 31 August\u20134 September 2015, pp. 609\u2013626 (2015)","DOI":"10.1007\/978-3-319-23219-5_42"},{"issue":"S\u20137","key":"19_CR6","doi-asserted-by":"publisher","first-page":"S13","DOI":"10.1186\/1471-2105-14-S7-S13","volume":"14","author":"V Bonnici","year":"2013","unstructured":"Bonnici, V., Giugno, R., Pulvirenti, A., Shasha, D.E., Ferro, A.: A subgraph isomorphism algorithm and its application to biochemical data. BMC Bioinf. 14(S\u20137), S13 (2013)","journal-title":"BMC Bioinf."},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-319-58961-9_12","volume-title":"Graph-Based Representations in Pattern Recognition","author":"V Carletti","year":"2017","unstructured":"Carletti, V., Foggia, P., Saggese, A., Vento, M.: Introducing VF3: a new algorithm for subgraph isomorphism. In: Foggia, P., Liu, C.-L., Vento, M. (eds.) GbRPR 2017. LNCS, vol. 10310, pp. 128\u2013139. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-58961-9_12"},{"issue":"10","key":"19_CR8","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"LP Cordella","year":"2004","unstructured":"Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: A (sub)graph isomorphism algorithm for matching large graphs. IEEE Trans. Pattern Anal. Mach. Intell. 26(10), 1367\u20131372 (2004)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"11","key":"19_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0143638","volume":"10","author":"T Davies","year":"2015","unstructured":"Davies, T., Marchione, E.: Event networks and the identification of crime pattern motifs. PLOS ONE 10(11), 1\u201319 (2015)","journal-title":"PLOS ONE"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0031909","volume-title":"Efficient Graph Rewriting and Its Implementation","year":"1995","unstructured":"D\u00f6rr, H. (ed.): Efficient Graph Rewriting and Its Implementation. LNCS, vol. 922. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/BFb0031909"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Elffers, J., Gocht, S., McCreesh, C., Nordstr\u00f6m, J.: Justifying all differences using Pseudo-Boolean reasoning. In: Proceedings of AAAI (2020). in press","DOI":"10.1609\/aaai.v34i02.5507"},{"issue":"2","key":"19_CR12","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.cosrev.2008.06.001","volume":"2","author":"J Fiala","year":"2008","unstructured":"Fiala, J., Kratochv\u00edl, J.: Locally constrained graph homomorphisms-structure, complexity, and applications. Comput. Sci. Rev. 2(2), 97\u2013111 (2008)","journal-title":"Comput. Sci. Rev."},{"key":"19_CR13","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":"19_CR14","unstructured":"Hoffmann, R., McCreesh, C., Reilly, C.: Between subgraph isomorphism and maximum common subgraph. In: Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, San Francisco, California, USA, 4\u20139 February 2017, pp. 3907\u20133914 (2017)"},{"key":"19_CR15","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":"19_CR16","unstructured":"Lecoutre, C., Sais, L., Tabary, S., Vidal, V.: Nogood recording from restarts. In: IJCAI 2007, Proceedings of the 20th International Joint Conference on Artificial Intelligence, Hyderabad, India, 6\u201312 January 2007, pp. 131\u2013136 (2007)"},{"key":"19_CR17","unstructured":"Lee, J.H.M., Schulte, C., Zhu, Z.: Increasing nogoods in restart-based search. In: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, Phoenix, Arizona, USA, 12\u201317 February 2016, pp. 3426\u20133433 (2016)"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"McCreesh, C., Prosser, P.: A parallel, backjumping subgraph isomorphism algorithm using supplemental graphs. In: Proceedings of Principles and Practice of Constraint Programming - 21st International Conference, CP 2015, Cork, Ireland, 31 August\u20134 September 2015, pp. 295\u2013312 (2015)","DOI":"10.1007\/978-3-319-23219-5_21"},{"key":"19_CR19","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1613\/jair.5768","volume":"61","author":"C McCreesh","year":"2018","unstructured":"McCreesh, C., Prosser, P., Solnon, C., Trimble, J.: When subgraph isomorphism is really hard, and why this matters for graph databases. J. Artif. Intell. Res. 61, 723\u2013759 (2018)","journal-title":"J. Artif. Intell. Res."},{"issue":"1","key":"19_CR20","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1186\/s12918-018-0533-6","volume":"12","author":"K Mukherjee","year":"2018","unstructured":"Mukherjee, K., Hasan, M.M., Boucher, C., Kahveci, T.: Counting motifs in dynamic networks. BMC Syst. Biol. 12(1), 6 (2018)","journal-title":"BMC Syst. Biol."},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Redmond, U., Cunningham, P.: Temporal subgraph isomorphism. In: Advances in Social Networks Analysis and Mining 2013, ASONAM 2013, Niagara, ON, Canada, 25\u201329 August 2013, pp. 1451\u20131452 (2013)","DOI":"10.1145\/2492517.2492586"},{"key":"19_CR22","unstructured":"R\u00e9gin, J.: A filtering algorithm for constraints of difference in CSPs. In: Proceedings of the 12th National Conference on Artificial Intelligence, Seattle, WA, USA, 31 July\u20134 August 1994, vol. 1, pp. 362\u2013367 (1994)"},{"key":"19_CR23","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.tcs.2015.02.011","volume":"577","author":"M Sevegnani","year":"2015","unstructured":"Sevegnani, M., Calder, M.: Bigraphs with sharing. Theor. Comput. Sci. 577, 43\u201373 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"Sims, C.C.: Computational methods in the study of permutation groups. In: Leech, J. (ed.) Computational Problems in Abstract Algebra, pp. 169\u2013183. Pergamon (1970)","DOI":"10.1016\/B978-0-08-012975-4.50020-5"},{"issue":"12\u201313","key":"19_CR25","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1016\/j.artint.2010.05.002","volume":"174","author":"C Solnon","year":"2010","unstructured":"Solnon, C.: Alldifferent-based filtering for subgraph isomorphism. Artif. Intell. 174(12\u201313), 850\u2013864 (2010)","journal-title":"Artif. Intell."},{"key":"19_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-20081-7_1","volume-title":"Graph-Based Representations in Pattern Recognition","author":"C Solnon","year":"2019","unstructured":"Solnon, C.: Experimental evaluation of subgraph isomorphism solvers. In: Conte, D., Ramel, J.-Y., Foggia, P. (eds.) GbRPR 2019. LNCS, vol. 11510, pp. 1\u201313. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-20081-7_1"},{"issue":"2","key":"19_CR27","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1137\/15M1030054","volume":"59","author":"C V\u00f6mel","year":"2017","unstructured":"V\u00f6mel, C., de Lorenzi, F., Beer, S., Fuchs, E.: The secret life of keys: on the calculation of mechanical lock systems. SIAM Rev. 59(2), 393\u2013422 (2017)","journal-title":"SIAM Rev."},{"issue":"3","key":"19_CR28","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10601-009-9074-3","volume":"15","author":"S Zampelli","year":"2010","unstructured":"Zampelli, S., Deville, Y., Solnon, C.: Solving subgraph isomorphism problems with constraint programming. Constraints 15(3), 327\u2013353 (2010)","journal-title":"Constraints"}],"container-title":["Lecture Notes in Computer Science","Graph Transformation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-51372-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T08:56:06Z","timestamp":1710233766000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-51372-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030513719","9783030513726"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-51372-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"23 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Graph Transformation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bergen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Norway","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icgt2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/av5.ljnet.it\/icgt2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4 tool presentations were also accepted and included. The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}