{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:34:39Z","timestamp":1742913279783,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030864712"},{"type":"electronic","value":"9783030864729"}],"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-86472-9_19","type":"book-chapter","created":{"date-parts":[[2021,8,30]],"date-time":"2021-08-30T22:02:41Z","timestamp":1630360961000},"page":"205-217","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["GPU-Accelerated Vertex Orbit Counting for 5-Vertex Subgraphs"],"prefix":"10.1007","author":[{"given":"Shuya","family":"Suganami","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshiyuki","family":"Amagasa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,31]]},"reference":[{"key":"19_CR1","unstructured":"EVOKE. https:\/\/bitbucket.org\/nojan-p\/orbit-counting\/src\/master\/"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Ahmed, N.K., Neville, J., Rossi, R.A., Duffield, N.: Efficient graphlet counting for large networks. In: 2015 IEEE International Conference on Data Mining, pp. 1\u201310. IEEE (2015)","DOI":"10.1109\/ICDM.2015.141"},{"issue":"10","key":"19_CR3","doi-asserted-by":"publisher","first-page":"1190","DOI":"10.14778\/3389133.3389137","volume":"13","author":"X Chen","year":"2020","unstructured":"Chen, X., Dathathri, R., Gill, G., Pingali, K.: Pangolin: an efficient and flexible graph mining system on CPU and GPU. Proc. VLDB Endow. 13(10), 1190\u20131205 (2020)","journal-title":"Proc. VLDB Endow."},{"key":"19_CR4","unstructured":"Harris, M., Sengupta, S., Owens, J.D.: Parallel prefix sum (scan) with CUDA. In: GPU Gems, vol. 3, no. 39, pp. 851\u2013876 (2007)"},{"issue":"4","key":"19_CR5","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1093\/bioinformatics\/btt717","volume":"30","author":"T Ho\u010devar","year":"2014","unstructured":"Ho\u010devar, T., Dem\u0161ar, J.: A combinatorial approach to graphlet counting. Bioinformatics 30(4), 559\u2013565 (2014)","journal-title":"Bioinformatics"},{"key":"19_CR6","unstructured":"Leskovec, J., Krevl, A.: SNAP datasets: stanford large network dataset collection, June 2014. http:\/\/snap.stanford.edu\/data"},{"key":"19_CR7","unstructured":"McKay, B.D., et al.: Practical graph isomorphism (1981)"},{"issue":"5594","key":"19_CR8","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1126\/science.298.5594.824","volume":"298","author":"R Milo","year":"2002","unstructured":"Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., Alon, U.: Network motifs: simple building blocks of complex networks. Science 298(5594), 824\u2013827 (2002)","journal-title":"Science"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-319-41754-7_13","volume-title":"Natural Language Processing and Information Systems","author":"AR Nabhan","year":"2016","unstructured":"Nabhan, A.R., Shaalan, K.: Keyword identification using text graphlet patterns. In: M\u00e9tais, E., Meziane, F., Saraee, M., Sugumaran, V., Vadera, S. (eds.) NLDB 2016. LNCS, vol. 9612, pp. 152\u2013161. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41754-7_13"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Pashanasangi, N., Seshadhri, C.: Efficiently counting vertex orbits of all 5-vertex subgraphs, by EVOKE. In: Proceedings of the 13th International Conference on Web Search and Data Mining, pp. 447\u2013455 (2020)","DOI":"10.1145\/3336191.3371773"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Pinar, A., Seshadhri, C., Vishal, V.: ESCAPE: efficiently counting all 5-vertex subgraphs. In: Proceedings of the 26th International Conference on World Wide Web, pp. 1431\u20131440 (2017)","DOI":"10.1145\/3038912.3052597"},{"issue":"2","key":"19_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3433652","volume":"54","author":"P Ribeiro","year":"2021","unstructured":"Ribeiro, P., Paredes, P., Silva, M.E., Aparicio, D., Silva, F.: A survey on subgraph counting: concepts, algorithms, and applications to network motifs and graphlets. ACM Comput. Surv. (CSUR) 54(2), 1\u201336 (2021)","journal-title":"ACM Comput. Surv. (CSUR)"},{"issue":"2","key":"19_CR13","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10618-013-0303-4","volume":"28","author":"P Ribeiro","year":"2014","unstructured":"Ribeiro, P., Silva, F.: G-Tries: a data structure for storing and finding subgraphs. Data Min. Knowl. Discov. 28(2), 337\u2013377 (2014). https:\/\/doi.org\/10.1007\/s10618-013-0303-4","journal-title":"Data Min. Knowl. Discov."},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: AAAI (2015). http:\/\/networkrepository.com","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Zhou, R.: Leveraging multiple GPUs and CPUs for graphlet counting in large networks. In: Proceedings of the 25th ACM International on Conference on Information and Knowledge Management, pp. 1783\u20131792. ACM (2016)","DOI":"10.1145\/2983323.2983832"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Seshadhri, C., Tirthapura, S.: Scalable subgraph counting: the methods behind the madness. In: Companion Proceedings of The 2019 World Wide Web Conference, pp. 1317\u20131318. ACM (2019)","DOI":"10.1145\/3308560.3320092"},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-030-59003-1_4","volume-title":"Database and Expert Systems Applications","author":"S Suganami","year":"2020","unstructured":"Suganami, S., Amagasa, T., Kitagawa, H.: Accelerating all 5-vertex subgraphs counting using GPUs. In: Hartmann, S., K\u00fcng, J., Kotsis, G., Tjoa, A.M., Khalil, I. (eds.) DEXA 2020. LNCS, vol. 12391, pp. 55\u201370. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59003-1_4"},{"issue":"1","key":"19_CR18","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1089\/cmb.2009.0029","volume":"17","author":"V Vacic","year":"2010","unstructured":"Vacic, V., Iakoucheva, L.M., Lonardi, S., Radivojac, P.: Graphlet kernels for prediction of functional residues in protein structures. J. Comput. Biol. 17(1), 55\u201372 (2010)","journal-title":"J. Comput. Biol."},{"issue":"9","key":"19_CR19","doi-asserted-by":"publisher","first-page":"1152","DOI":"10.1093\/bioinformatics\/btl038","volume":"22","author":"S Wernicke","year":"2006","unstructured":"Wernicke, S., Rasche, F.: FANMOD: a tool for fast network motif detection. Bioinformatics 22(9), 1152\u20131153 (2006)","journal-title":"Bioinformatics"},{"issue":"1","key":"19_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13040-014-0029-x","volume":"8","author":"Q Zhang","year":"2015","unstructured":"Zhang, Q., Xu, Y.: Motif mining based on network space compression. BioData Min. 8(1), 1\u201313 (2015)","journal-title":"BioData Min."}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86472-9_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T19:39:39Z","timestamp":1710358779000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86472-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030864712","9783030864729"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86472-9_19","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":"31 August 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DEXA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database and Expert Systems Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dexa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.dexa.org\/dexa2021","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"149","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":"37","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":"31","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":"25% - 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":"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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"DEXA 2021 Workshops: 50 papers submitted, 23 papers accepted","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)"}}]}}