{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:52:34Z","timestamp":1773481954020,"version":"3.50.1"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030200800","type":"print"},{"value":"9783030200817","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-20081-7_14","type":"book-chapter","created":{"date-parts":[[2019,6,9]],"date-time":"2019-06-09T23:02:31Z","timestamp":1560121351000},"page":"141-151","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["A Parallel Algorithm for Subgraph Isomorphism"],"prefix":"10.1007","author":[{"given":"Vincenzo","family":"Carletti","sequence":"first","affiliation":[]},{"given":"Pasquale","family":"Foggia","sequence":"additional","affiliation":[]},{"given":"Pierluigi","family":"Ritrovato","sequence":"additional","affiliation":[]},{"given":"Mario","family":"Vento","sequence":"additional","affiliation":[]},{"given":"Vincenzo","family":"Vigilante","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,16]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.patrec.2017.10.007","volume":"100","author":"Z Abu-Aisheh","year":"2017","unstructured":"Abu-Aisheh, Z., et al.: Graph edit distance contest: results and future challenges. Pattern Recogn. Lett. 100, 96\u20131103 (2017)","journal-title":"Pattern Recogn. Lett."},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.eswa.2017.10.043","volume":"94","author":"Z Abu-Aisheh","year":"2018","unstructured":"Abu-Aisheh, Z., Raveaux, R., Ramel, J.Y., Martineau, P.: A parallel graph edit distance algorithm. Expert Syst. Appl. 94, 41\u201357 (2018)","journal-title":"Expert Syst. Appl."},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1093\/bib\/bbl022","volume":"7","author":"T Aittokallio","year":"2006","unstructured":"Aittokallio, T., Schwikowski, B.: Graph-based methods for analysing networks in cell biology. Briefings Bioinform. 7, 243\u2013255 (2006)","journal-title":"Briefings Bioinform."},{"key":"14_CR4","unstructured":"Computational pan-genomics: status, promises and challenges. Oxford J. Brief. Bioinf. 19, 118\u2013135 (2016)"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1471-2105-14-S7-S13","volume":"14","author":"V Bonnici","year":"2013","unstructured":"Bonnici, V., Giugno, R., Pulvirenti, A., Shasha, D., Ferro, A.: A subgraph isomorphism algorithm and its application to biochemical data. BMC Bioinform. 14, 1\u201313 (2013)","journal-title":"BMC Bioinform."},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.patrec.2016.10.001","volume":"87","author":"S Bougleux","year":"2017","unstructured":"Bougleux, S., Brun, L., Carletti, V., Foggia, P., Gazre, B., Vento, M.: Graph edit distance as a quadratic assignment problem. Pattern Recogn. Lett. 87, 38\u201346 (2017)","journal-title":"Pattern Recogn. Lett."},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Broecheler, M., Pugliese, A., Subrahmanian, V.S.: COSI: cloud oriented subgraph identification in massive social networks. In: 2010 International Conference on Advances in Social Networks Analysis and Mining (2010)","DOI":"10.1109\/ASONAM.2010.80"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1109\/TPAMI.2017.2696940","volume":"40","author":"V Carletti","year":"2018","unstructured":"Carletti, V., Foggia, P., Saggese, A., Vento, M.: Challenging the time complexity of exact subgraph isomorphism for huge and dense graphs with VF3. IEEE Trans. Pattern Anal. Mach. Intell. 40, 804\u2013818 (2018)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-319-18224-7_18","volume-title":"Graph-Based Representations in Pattern Recognition","author":"V Carletti","year":"2015","unstructured":"Carletti, V., Foggia, P., Vento, M., Jiang, X.: Report on the first contest on graph matching algorithms for pattern search in biological databases. In: Liu, C.-L., Luo, B., Kropatsch, W.G., Cheng, J. (eds.) GbRPR 2015. LNCS, vol. 9069, pp. 178\u2013187. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18224-7_18"},{"key":"14_CR10","unstructured":"Carletti, V., Foggia, P., Greco, A., Saggese, A., Vento, M.: Comparing performance of graph matching algorithms on huge graphs. Pattern Recogn. Lett. (2018)"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-319-97785-0_30","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"V Carletti","year":"2018","unstructured":"Carletti, V., Foggia, P., Greco, A., Saggese, A., Vento, M.: The VF3-light subgraph isomorphism algorithm: when doing less is more effective. In: Bai, X., Hancock, E.R., Ho, T.K., Wilson, R.C., Biggio, B., Robles-Kelly, A. (eds.) S+SSPR 2018. LNCS, vol. 11004, pp. 315\u2013325. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-97785-0_30"},{"key":"14_CR12","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"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-642-41190-8_44","volume-title":"New Trends in Image Analysis and Processing \u2013 ICIAP 2013","author":"V Carletti","year":"2013","unstructured":"Carletti, V., Foggia, P., Vento, M.: Performance comparison of five exact graph matching algorithms on biological databases. In: Petrosino, A., Maddalena, L., Pala, P. (eds.) ICIAP 2013. LNCS, vol. 8158, pp. 409\u2013417. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-41190-8_44"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-319-18224-7_17","volume-title":"Graph-Based Representations in Pattern Recognition","author":"V Carletti","year":"2015","unstructured":"Carletti, V., Foggia, P., Vento, M.: VF2 plus: an improved version of VF2 for biological graphs. In: Liu, C.-L., Luo, B., Kropatsch, W.G., Cheng, J. (eds.) GbRPR 2015. LNCS, vol. 9069, pp. 168\u2013177. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18224-7_17"},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/971617.971643","volume":"47","author":"T Coffman","year":"2004","unstructured":"Coffman, T., Greenblatt, S., Marcus, S.: Graph-based technologies for intelligence analysis. Commun. ACM 47, 45\u201347 (2004)","journal-title":"Commun. ACM"},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1142\/S0218001404003228","volume":"18","author":"D Conte","year":"2004","unstructured":"Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. Int. J. Pattern Recogn. Artif. Intell. 18, 265\u2013298 (2004)","journal-title":"Int. J. Pattern Recogn. Artif. Intell."},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"L Cordella","year":"2004","unstructured":"Cordella, L., Foggia, P., Sansone, C., Vento, M.: A (sub)graph isomorphism algorithm for matching large graphs. IEEE Trans. Pattern Anal. Mach. Intell. 26, 1367\u20131372 (2004)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"1450001","DOI":"10.1142\/S0218001414500013","volume":"28","author":"P Foggia","year":"2014","unstructured":"Foggia, P., Percannella, G., Vento, M.: Graph matching and learning in pattern recognition on the last ten years. J. Pattern Recogn. 28, 1450001 (2014)","journal-title":"J. Pattern Recogn."},{"key":"14_CR19","volume-title":"Designing and Building Parallel Programs: Concepts and Tools for Parallel Software Engineering","author":"I Foster","year":"1995","unstructured":"Foster, I.: Designing and Building Parallel Programs: Concepts and Tools for Parallel Software Engineering. Addison-Wesley Longman Publishing Co., Inc., Boston (1995)"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-642-23397-5_42","volume-title":"Euro-Par 2011 Parallel Processing","author":"J Jenkins","year":"2011","unstructured":"Jenkins, J., Arkatkar, I., Owens, J.D., Choudhary, A., Samatova, N.F.: Lessons learned from exploring the backtracking paradigm on the GPU. In: Jeannot, E., Namyst, R., Roman, J. (eds.) Euro-Par 2011. LNCS, vol. 6853, pp. 425\u2013437. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23397-5_42"},{"key":"14_CR21","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1109\/TCBB.2006.55","volume":"3","author":"V Lacroix","year":"2006","unstructured":"Lacroix, V., Fernandez, C., Sagot, M.: Motif search in graphs: application to metabolic networks. Trans. Comput. Biol. Bioinf. 3, 360\u2013368 (2006)","journal-title":"Trans. Comput. Biol. Bioinf."},{"key":"14_CR22","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"},{"key":"14_CR23","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1101\/gr.214155.116","volume":"27","author":"B Paten","year":"2017","unstructured":"Paten, B., Novak, A.M., Eizenga, J.M., Garrison, E.: Genome graphs and the evolution of genome inference. Genome Res. 27, 665\u2013676 (2017)","journal-title":"Genome Res."},{"key":"14_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-642-20844-7_14","volume-title":"Graph-Based Representations in Pattern Recognition","author":"D Rodenas","year":"2011","unstructured":"Rodenas, D., Serratosa, F., Sol\u00e9-Ribalta, A.: Parallel graduated assignment algorithm for multiple graph matching based on a common labelling. In: Jiang, X., Ferrer, M., Torsello, A. (eds.) GbRPR 2011. LNCS, vol. 6658, pp. 132\u2013141. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20844-7_14"},{"key":"14_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, 850\u2013864 (2010)","journal-title":"Artif. Intell."},{"key":"14_CR26","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.patcog.2014.01.002","volume":"48","author":"M Vento","year":"2014","unstructured":"Vento, M.: A long trip in the charming world of graphs for pattern recognition. Pattern Recogn. 48, 291\u2013301 (2014)","journal-title":"Pattern Recogn."},{"key":"14_CR27","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815478","volume-title":"Social Network Analysis: Methods and Applications","author":"S Wasserman","year":"1994","unstructured":"Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications. Cambridge University Press, Cambridge (1994)"},{"key":"14_CR28","doi-asserted-by":"crossref","unstructured":"Xie, X., Li, Z., Zhang, H.: Efficient subgraph matching in large graph with partitioning scheme. In: 13th Web Information Systems and Applications Conference (2016)","DOI":"10.1109\/WISA.2016.16"},{"key":"14_CR29","doi-asserted-by":"crossref","unstructured":"Xu, Q., Jeon, H., Annavaram, M.: Graph processing on GPUs: where are the bottlenecks. In: 2014 IEEE International Symposium on Workload Characterization (2014)","DOI":"10.1109\/IISWC.2014.6983053"}],"container-title":["Lecture Notes in Computer Science","Graph-Based Representations in Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-20081-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T13:34:23Z","timestamp":1709818463000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-20081-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030200800","9783030200817"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-20081-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"16 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GbRPR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Based Representations in Pattern Recognition","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tours","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":"19 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gbrpr2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/gbr2019.sciencesconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}