{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T16:08:38Z","timestamp":1768320518153,"version":"3.49.0"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319503486","type":"print"},{"value":"9783319503493","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-50349-3_8","type":"book-chapter","created":{"date-parts":[[2016,11,30]],"date-time":"2016-11-30T07:12:11Z","timestamp":1480489931000},"page":"107-122","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Portfolios of Subgraph Isomorphism Algorithms"],"prefix":"10.1007","author":[{"given":"Lars","family":"Kotthoff","sequence":"first","affiliation":[]},{"given":"Ciaran","family":"McCreesh","sequence":"additional","affiliation":[]},{"given":"Christine","family":"Solnon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,12,1]]},"reference":[{"key":"8_CR1","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","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.) CP 2014. LNCS, vol. 8656, pp. 125\u2013141. Springer, Heidelberg (2014). doi: 10.1007\/978-3-319-10428-7_12 . http:\/\/dx.doi.org\/10.1007\/978-3-319-10428-7_12"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/978-3-540-74446-7_8","volume-title":"Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics","author":"R Battiti","year":"2007","unstructured":"Battiti, R., Mascia, F.: An algorithm portfolio for the sub-graph isomorphism problem. In: St\u00fctzle, T., Birattari, M., Hoos, H.H. (eds.) SLS 2007. LNCS, vol. 4638, pp. 106\u2013120. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-74446-7_8"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Bischl, B., Kerschke, P., Kotthoff, L., Lindauer, M.T., Malitsky, Y., Fr\u00e9chette, A., Hoos, H.H., Hutter, F., Leyton-Brown, K., Tierney, K., Vanschoren, J.: ASlib: a benchmark library for algorithm selection. Artif. Intell. J. (2016, in press)","DOI":"10.1016\/j.artint.2016.04.003"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Cohen, W.W.: Fast effective rule induction. In: Twelfth International Conference on Machine Learning, pp. 115\u2013123. Morgan Kaufmann (1995)","DOI":"10.1016\/B978-1-55860-377-6.50023-2"},{"issue":"10","key":"8_CR5","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). http:\/\/doi.ieeecomputersociety.org\/10.1109\/TPAMI.2004.75","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"7","key":"8_CR6","doi-asserted-by":"publisher","first-page":"996","DOI":"10.1016\/j.cviu.2010.12.013","volume":"115","author":"G Damiand","year":"2011","unstructured":"Damiand, G., Solnon, C., de la Higuera, C., Janodet, J.C., Samuel, E.: Polynomial algorithms for subisomorphism of nD open combinatorial maps. Comput. Vis. Image Underst. (CVIU) 115(7), 996\u20131010 (2011)","journal-title":"Comput. Vis. Image Underst. (CVIU)"},{"issue":"8","key":"8_CR7","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1016\/S0167-8655(02)00253-2","volume":"24","author":"M Santo De","year":"2003","unstructured":"De Santo, M., 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). http:\/\/dx.doi.org\/10.1016\/S0167-8655(02)00253\u20132","journal-title":"Pattern Recogn. Lett."},{"key":"8_CR8","unstructured":"Giugno, R., Bonnici, V., Bombieri, N., Pulvirenti, A., Ferro, A., Shasha, D.: Grapes: a software for parallel searching on biological graphs targeting multi-core architectures. PLoS ONE 8(10), e76911 (2013). http:\/\/dx.doi.org\/10.1371%2Fjournal.pone.0076911"},{"issue":"1\u20132","key":"8_CR9","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0004-3702(00)00081-3","volume":"126","author":"CP Gomes","year":"2001","unstructured":"Gomes, C.P., Selman, B.: Algorithm portfolios. Artif. Intell. 126(1\u20132), 43\u201362 (2001)","journal-title":"Artif. Intell."},{"issue":"5296","key":"8_CR10","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1126\/science.275.5296.51","volume":"275","author":"BA Huberman","year":"1997","unstructured":"Huberman, B.A., Lukose, R.M., Hogg, T.: An economics approach to hard computational problems. Science 275(5296), 51\u201354 (1997)","journal-title":"Science"},{"key":"8_CR11","unstructured":"Kotthoff, L.: LLAMA: Leveraging learning to automatically manage algorithms. Technical report arXiv:1306.1031 June 2003"},{"issue":"3","key":"8_CR12","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1609\/aimag.v35i3.2460","volume":"35","author":"L Kotthoff","year":"2014","unstructured":"Kotthoff, L.: Algorithm selection for combinatorial search problems: a survey. AI Mag. 35(3), 48\u201360 (2014)","journal-title":"AI Mag."},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-319-19084-6_18","volume-title":"Learning and Intelligent Optimization","author":"L Kotthoff","year":"2015","unstructured":"Kotthoff, L., Kerschke, P., Hoos, H., Trautmann, H.: Improving the state of the art in inexact TSP solving using per-instance algorithm selection. In: Dhaenens, C., Jourdan, L., Marmion, M.-E. (eds.) LION 2015. LNCS, vol. 8994, pp. 202\u2013217. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-19084-6_18"},{"issue":"4","key":"8_CR14","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1017\/S0960129501003577","volume":"12","author":"J Larrosa","year":"2002","unstructured":"Larrosa, J., Valiente, G.: Constraint satisfaction algorithms for graph pattern matching. Math. Struct. Compt. Sci. 12(4), 403\u2013422 (2002)","journal-title":"Math. Struct. Compt. Sci."},{"key":"8_CR15","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, Heidelberg (2015). doi: 10.1007\/978-3-319-23219-5_21 . http:\/\/dx.doi.org\/10.1007\/978-3-319-23219-5_21"},{"key":"8_CR16","unstructured":"McCreesh, C., Prosser, P., Trimble, J.: Heuristics and really hard instances for subgraph isomorphism problems. In: IJCAI (2016, to appear)"},{"issue":"3","key":"8_CR17","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0020-0255(79)90023-9","volume":"19","author":"JJ McGregor","year":"1979","unstructured":"McGregor, J.J.: Relational consistency algorithms and their application in finding subgraph and graph isomorphisms. Inf. Sci. 19(3), 229\u2013250 (1979)","journal-title":"Inf. Sci."},{"key":"8_CR18","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0004-3702(86)90083-4","volume":"28","author":"R Mohr","year":"1986","unstructured":"Mohr, R., Henderson, T.: Arc and path consistency revisited. Artif. Intell. 28, 225\u2013233 (1986)","journal-title":"Artif. Intell."},{"key":"8_CR19","unstructured":"O\u2019Mahony, E., Hebrard, E., Holland, A., Nugent, C., O\u2019Sullivan, B.: Using case-based reasoning in an algorithm portfolio for constraint solving. In: Proceedings of the 19th Irish Conference on Artificial Intelligence and Cognitive Science, January 2008"},{"key":"8_CR20","unstructured":"R\u00e9gin, J.C.: A filtering algorithm for constraints of difference in CSPs. In: Proceeding of the 12th Conference American Association Artificial Intelligence, vol. 1, pp. 362\u2013367. American Association Artificial Intelligence (1994)"},{"key":"8_CR21","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0065-2458(08)60520-3","volume":"15","author":"JR Rice","year":"1976","unstructured":"Rice, J.R.: The algorithm selection problem. Adv. Comput. 15, 65\u2013118 (1976)","journal-title":"Adv. Comput."},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1007\/978-3-319-10428-7_48","volume-title":"Principles and Practice of Constraint Programming","author":"A Sabharwal","year":"2014","unstructured":"Sabharwal, A., Samulowitz, H.: Insights into parallelism with intensive knowledge sharing. In: O\u2019Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 655\u2013671. Springer, Heidelberg (2014). doi: 10.1007\/978-3-319-10428-7_48 . http:\/\/dx.doi.org\/10.1007\/978-3-319-10428-7_12"},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"Seipp, J., Braun, M., Garimort, J., Helmert, M.: Learning portfolios of automatically tuned planners. In: ICAPS (2012)","DOI":"10.1609\/icaps.v22i1.13538"},{"key":"8_CR24","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). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397515001085","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"8_CR25","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/j.patcog.2014.05.019","volume":"48","author":"C Solnon","year":"2015","unstructured":"Solnon, C., Damiand, G., de la Higuera, C., Janodet, J.: On the complexity of submap isomorphism and maximum common submap problems. Pattern Recogn. 48(2), 302\u2013316 (2015)","journal-title":"Pattern Recogn."},{"issue":"12\u201313","key":"8_CR26","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). http:\/\/dx.doi.org\/10.1016\/j.artint.2010.05.002","journal-title":"Artif. Intell."},{"issue":"1","key":"8_CR27","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"JR Ullmann","year":"1976","unstructured":"Ullmann, J.R.: An algorithm for subgraph isomorphism. J. ACM 23(1), 31\u201342 (1976)","journal-title":"J. ACM"},{"key":"8_CR28","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1613\/jair.2490","volume":"32","author":"L Xu","year":"2008","unstructured":"Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: SATzilla: Portfolio-based algorithm selection for SAT. J. Artif. Intell. Res. (JAIR) 32, 565\u2013606 (2008)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"issue":"3","key":"8_CR29","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","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50349-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,21]],"date-time":"2023-08-21T03:38:25Z","timestamp":1692589105000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-50349-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319503486","9783319503493"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50349-3_8","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":"1 December 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LION","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Learning and Intelligent Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ischia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"29 May 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 June 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lion2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.lion10.unina.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}