{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T22:40:06Z","timestamp":1756334406701,"version":"3.44.0"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030856649"},{"type":"electronic","value":"9783030856656"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-85665-6_25","type":"book-chapter","created":{"date-parts":[[2021,8,28]],"date-time":"2021-08-28T03:06:52Z","timestamp":1630120012000},"page":"402-417","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["G-Morph: Induced Subgraph Isomorphism Search of\u00a0Labeled Graphs on a GPU"],"prefix":"10.1007","author":[{"given":"Bryan","family":"Rowe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajiv","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,25]]},"reference":[{"key":"25_CR1","unstructured":"Boost Graph Library: VF2 (Sub)Graph Isomorphism - master (2020). https:\/\/www.boost.org\/doc\/libs\/master\/libs\/graph\/doc\/vf2_sub_graph_iso.html. Accessed July 2020"},{"key":"25_CR2","unstructured":"Chapter 39. Parallel Prefix Sum (Scan) with CUDA (2020). https:\/\/developer.nvidia.com\/gpugems\/gpugems3\/part-vi-gpu-computing\/chapter-39-parallel-prefix-sum-scan-cuda. Accessed July 2020"},{"key":"25_CR3","unstructured":"MiviaLab\/vf3lib: VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs (2020). https:\/\/github.com\/MiviaLab\/vf3lib. Accessed July 2020"},{"key":"25_CR4","unstructured":"bookug\/GSI: GPU-friendly subgraph isomorphism (2020). https:\/\/github.com\/bookug\/GSI. Accessed Oct 2020"},{"issue":"S7","key":"25_CR5","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., Ferro, A.: A subgraph isomorphism algorithm and its application to biochemical data. BMC Bioinformatics 14(S7), S13 (2013)","journal-title":"BMC Bioinformatics"},{"key":"25_CR6","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":"25_CR7","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."},{"key":"25_CR8","unstructured":"Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: An improved algorithm for matching large graphs. In: Workshop on Graph-Based Representations in Pattern Recognition, pp. 149\u2013159 (2001)"},{"issue":"13","key":"25_CR9","doi-asserted-by":"publisher","first-page":"1510","DOI":"10.14778\/2536258.2536263","volume":"6","author":"W Fan","year":"2013","unstructured":"Fan, W., Wang, X., Wu, Y.: Diversified top-k graph pattern matching. Proc. VLDB Endowment 6(13), 1510\u20131521 (2013)","journal-title":"Proc. VLDB Endowment"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Han, T.D., Abdelrahman, T.S.: Reducing branch divergence in GPU programs. In: Workshop on General Purpose Processing on Graphics Processing Units, pp. 1\u20138 (2011)","DOI":"10.1145\/1964179.1964184"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Han, W.S., Lee, J., Lee, J.H.: TurboISO: towards ultrafast and robust subgraph isomorphism search in large graph databases. In: ACM SIGMOD International Conference on Management of Data, pp. 337\u2013348 (2013)","DOI":"10.1145\/2463676.2465300"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"He, B., et al.: Relational joins on graphics processors. In: ACM SIGMOD International Conference on Management of Data, pp. 511\u2013524 (2008)","DOI":"10.1145\/1376616.1376670"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Khorasani, F., Gupta, R., Bhuyan, L.N.: Scalable SIMD-efficient graph processing on GPUs. In: International Conference on Parallel Architectures and Compilation Techniques, pp. 39\u201350 (2015)","DOI":"10.1109\/PACT.2015.15"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Khorasani, F., Vora, K., Gupta, R., Bhuyan, L.N.: CuSha: vertex-centric graph processing on GPUs. In: International Symposium on High-performance Parallel and Distributed Computing, pp. 239\u2013252 (2014)","DOI":"10.1145\/2600212.2600227"},{"issue":"2","key":"25_CR15","doi-asserted-by":"publisher","first-page":"133","DOI":"10.14778\/2535568.2448946","volume":"6","author":"J Lee","year":"2012","unstructured":"Lee, J., Han, W.S., Kasperovics, R., Lee, J.H.: An in-depth comparison of subgraph isomorphism algorithms in graph databases. Proc. VLDB Endowment 6(2), 133\u2013144 (2012)","journal-title":"Proc. VLDB Endowment"},{"key":"25_CR16","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford large network dataset collection (2014). http:\/\/snap.stanford.edu\/data"},{"key":"25_CR17","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":"7","key":"25_CR18","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."},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Reza, T., Ripeanu, M., Tripoul, N., Sanders, G., Pearce, R.: PruneJuice: pruning trillion-edge graphs to a precise pattern-matching solution. In: International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 265\u2013281 (2018)","DOI":"10.1109\/SC.2018.00024"},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"Serafini, M., De Francisci Morales, G., Siganos, G.: QFrag: distributed graph search via subgraph isomorphism. In: Symposium on Cloud Computing, pp. 214\u2013228 (2017)","DOI":"10.1145\/3127479.3131625"},{"key":"25_CR21","doi-asserted-by":"crossref","unstructured":"Shamir, R., Tsur, D.: Faster subtree isomorphism. In: Israeli Symposium on Theory of Computing and Systems, pp. 126\u2013131 (1997)","DOI":"10.1109\/ISTCS.1997.595164"},{"issue":"1","key":"25_CR22","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/TKDE.2016.2598561","volume":"29","author":"C Shi","year":"2016","unstructured":"Shi, C., Li, Y., Zhang, J., Sun, Y., Philip, S.Y.: A survey of heterogeneous information network analysis. IEEE Trans. Knowl. Data Eng. 29(1), 17\u201337 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"10","key":"25_CR23","doi-asserted-by":"publisher","first-page":"1887","DOI":"10.1109\/TKDE.2018.2807442","volume":"30","author":"Q Song","year":"2018","unstructured":"Song, Q., Wu, Y., Lin, P., Dong, L.X., Sun, H.: Mining summaries for knowledge graph search. IEEE Trans. Knowl. Data Eng. 30(10), 1887\u20131900 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"25_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-319-18120-2_18","volume-title":"Database Systems for Advanced Applications","author":"H-N Tran","year":"2015","unstructured":"Tran, H.-N., Kim, J., He, B.: Fast subgraph matching on large graphs using graphics processors. In: Renz, M., Shahabi, C., Zhou, X., Cheema, M.A. (eds.) DASFAA 2015. LNCS, vol. 9049, pp. 299\u2013315. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18120-2_18"},{"issue":"1","key":"25_CR25","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. JACM 23(1), 31\u201342 (1976)","journal-title":"JACM"},{"key":"25_CR26","unstructured":"Wang, L., Wang, Y., Owens, J.D.: Fast parallel subgraph matching on the GPU. In: High Performance Parallel and Dist. Computing (2016)"},{"key":"25_CR27","doi-asserted-by":"crossref","unstructured":"Wang, Y., Davidson, A., Pan, Y., Wu, Y., Riffel, A., Owens, J.D.: Gunrock: a high-performance graph processing library on the GPU. In: Symposium on Principles and Practice of Parallel Programming, pp. 1\u201312 (2016)","DOI":"10.1145\/2851141.2851145"},{"key":"25_CR28","doi-asserted-by":"crossref","unstructured":"Webber, J.: A programmatic introduction to Neo4j. In: Conference on Systems, Programming, and Apps: Software for Humanity, pp. 217\u2013218 (2012)","DOI":"10.1145\/2384716.2384777"},{"key":"25_CR29","doi-asserted-by":"crossref","unstructured":"Zeng, L., Zou, L., \u00d6zsu, M.T., Hu, L., Zhang, F.: GSI: GPU-friendly subgraph isomorphism. In: International Conference on Data Engineering, pp. 1249\u20131260 (2020)","DOI":"10.1109\/ICDE48307.2020.00112"},{"key":"25_CR30","doi-asserted-by":"crossref","unstructured":"Zhang, S., Li, S., Yang, J.: GADDI: distance index based subgraph matching in biological networks. In: International Conference on Extending Database Technology: Advances in Database Technology, pp. 192\u2013203 (2009)","DOI":"10.1145\/1516360.1516384"},{"key":"25_CR31","doi-asserted-by":"crossref","unstructured":"Zheng, W., Zou, L., Lian, X., Hong, L., Zhao, D.: Efficient subgraph skyline search over large graphs. In: ACM International Conference on Information and Knowledge Management, pp. 1529\u20131538 (2014)","DOI":"10.1145\/2661829.2662037"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2021: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-85665-6_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T22:02:45Z","timestamp":1756332165000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85665-6_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030856649","9783030856656"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85665-6_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"25 August 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Euro-Par","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2021.euro-par.org\/","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":"136","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":"38","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":"28% - 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":"4","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":"6","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":"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)"}}]}}