{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:00:48Z","timestamp":1740099648250,"version":"3.37.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030431198"},{"type":"electronic","value":"9783030431204"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-43120-4_25","type":"book-chapter","created":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T00:13:56Z","timestamp":1584490436000},"page":"324-332","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Fast Counting Method for 6-Motifs with Low Connectivity"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2890-344X","authenticated-orcid":false,"given":"Taha","family":"Sevim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0668-4354","authenticated-orcid":false,"given":"Muhammet Sel\u00e7uk","family":"G\u00fcvel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6105-1694","authenticated-orcid":false,"given":"Lale","family":"\u00d6zkahya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,3,18]]},"reference":[{"key":"25_CR1","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":"6295","key":"25_CR2","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1126\/science.aad9029","volume":"353","author":"AR Benson","year":"2016","unstructured":"Benson, A.R., Gleich, D.F., Leskovec, J.: Higher-order organization of complex networks. Science 353(6295), 163\u2013166 (2016)","journal-title":"Science"},{"issue":"5","key":"25_CR3","doi-asserted-by":"publisher","first-page":"1296","DOI":"10.1109\/TCBB.2011.19","volume":"8","author":"N Betzler","year":"2011","unstructured":"Betzler, N., Van Bevern, R., Fellows, M.R., Komusiewicz, C., Niedermeier, R.: Parameterized algorithmics for finding connected motifs in biological networks. IEEE\/ACM Trans. Comput. Biol. Bioinform. (TCBB) 8(5), 1296\u20131308 (2011)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform. (TCBB)"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Bhuiyan, M.A., Rahman, M., Rahman, M., Al Hasan, M.: GUISE: uniform sampling of graphlets for large graph analysis. In: 2012 IEEE 12th International Conference on Data Mining, pp. 91\u2013100. IEEE (2012)","DOI":"10.1109\/ICDM.2012.87"},{"key":"25_CR5","unstructured":"Bressan, M., Leucci, S., Panconesi, A.: Motivo: fast motif counting via succinct color coding and adaptive sampling (2019). \nhttps:\/\/arxiv.org\/pdf\/1906.01599.pdf"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Elenberg, E.R., Shanmugam, K., Borokhovich, M., Dimakis, A.G.: Beyond triangles: a distributed framework for estimating 3-profiles of large graphs. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 229\u2013238. ACM (2015)","DOI":"10.1145\/2783258.2783413"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Elenberg, E.R., Shanmugam, K., Borokhovich, M., Dimakis, A.G.: Distributed estimation of graph 4-profiles. In: Proceedings of the 25th International Conference on World Wide Web, pp. 483\u2013493. International World Wide Web Conferences Steering Committee (2016)","DOI":"10.1145\/2872427.2883082"},{"issue":"3","key":"25_CR8","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.socnet.2010.03.004","volume":"32","author":"K Faust","year":"2010","unstructured":"Faust, K.: A puzzle concerning triads in social networks: graph constraints and the triad census. Soc. Netw. 32(3), 221\u2013233 (2010)","journal-title":"Soc. Netw."},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0167-5060(08)70779-9","volume":"38","author":"O Frank","year":"1988","unstructured":"Frank, O.: Triad count statistics. Ann. Discrete Math. 38, 141\u2013149 (1988)","journal-title":"Ann. Discrete Math."},{"issue":"3","key":"25_CR10","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1080\/15427951.2009.10390645","volume":"6","author":"M Gonen","year":"2009","unstructured":"Gonen, M., Shavitt, Y.: Approximating the number of network motifs. Internet Math. 6(3), 349\u2013372 (2009)","journal-title":"Internet Math."},{"issue":"4","key":"25_CR11","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":"25_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/270703","volume":"7","author":"PW Holland","year":"1976","unstructured":"Holland, P.W., Leinhardt, S.: Local structure in social networks. Sociol. Methodol. 7, 1\u201345 (1976)","journal-title":"Sociol. Methodol."},{"issue":"7","key":"25_CR13","doi-asserted-by":"publisher","first-page":"e118","DOI":"10.1371\/journal.pcbi.0030118","volume":"3","author":"F Hormozdiari","year":"2007","unstructured":"Hormozdiari, F., Berenbrink, P., Pr\u017eulj, N., Sahinalp, S.C.: Not all scale-free networks are born equal: the role of the seed graph in PPI network evolution. PLoS Comput. Biol. 3(7), e118 (2007)","journal-title":"PLoS Comput. Biol."},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Jha, M., Seshadhri, C., Pinar, A.: Path sampling: a fast and provable method for estimating 4-vertex subgraph counts. In: Proceedings of the 24th International Conference on World Wide Web, pp. 495\u2013505. International World Wide Web Conferences Steering Committee (2015)","DOI":"10.1145\/2736277.2741101"},{"issue":"1","key":"25_CR15","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1186\/1471-2105-10-318","volume":"10","author":"ZRM Kashani","year":"2009","unstructured":"Kashani, Z.R.M., et al.: Kavosh: a new algorithm for finding network motifs. BMC Bioinform. 10(1), 318 (2009)","journal-title":"BMC Bioinform."},{"issue":"11","key":"25_CR16","doi-asserted-by":"publisher","first-page":"1746","DOI":"10.1093\/bioinformatics\/bth163","volume":"20","author":"N Kashtan","year":"2004","unstructured":"Kashtan, N., Itzkovitz, S., Milo, R., Alon, U.: Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs. Bioinformatics 20(11), 1746\u20131758 (2004)","journal-title":"Bioinformatics"},{"key":"25_CR17","unstructured":"Leskovec, J., Krevl, A.: Stanford large network dataset collection (2014). \nhttps:\/\/snap.stanford.edu\/data"},{"issue":"5594","key":"25_CR18","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":"25_CR19","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. International World Wide Web Conferences Steering Committee (2017)","DOI":"10.1145\/3038912.3052597"},{"issue":"10","key":"25_CR20","doi-asserted-by":"publisher","first-page":"2466","DOI":"10.1109\/TKDE.2013.2297929","volume":"26","author":"M Rahman","year":"2014","unstructured":"Rahman, M., Bhuiyan, M.A., Al Hasan, M.: GRAFT: an efficient graphlet counting method for large graph analysis. IEEE Trans. Knowl. Data Eng. 26(10), 2466\u20132478 (2014)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"25_CR21","unstructured":"Rossi, R., Ahmed, N.: Network data repository (2012). \nhttps:\/\/networkrepository.com"},{"key":"25_CR22","doi-asserted-by":"crossref","unstructured":"Sariyuce, A.E., Seshadhri, C., Pinar, A., Catalyurek, U.V.: Finding the hierarchy of dense subgraphs using nucleus decompositions. In: Proceedings of the 24th International Conference on World Wide Web, pp. 927\u2013937. International World Wide Web Conferences Steering Committee (2015)","DOI":"10.1145\/2736277.2741640"},{"key":"25_CR23","unstructured":"Seshadhri, C., Pinar, A., Kolda, T.G.: Fast triangle counting through wedge sampling. In: Proceedings of the SIAM Conference on Data Mining, vol. 4, p. 5 (2013)"},{"key":"25_CR24","unstructured":"Shervashidze, N., Vishwanathan, S., Petri, T., Mehlhorn, K., Borgwardt, K.: Efficient graphlet kernels for large graph comparison. In: Artificial Intelligence and Statistics, pp. 488\u2013495 (2009)"},{"key":"25_CR25","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C.: The K-clique densest subgraph problem. In: Proceedings of the 24th International Conference on World Wide Web, pp. 1122\u20131132. International World Wide Web Conferences Steering Committee (2015)","DOI":"10.1145\/2736277.2741098"},{"issue":"6","key":"25_CR26","doi-asserted-by":"publisher","first-page":"703","DOI":"10.7155\/jgaa.00245","volume":"15","author":"CE Tsourakakis","year":"2011","unstructured":"Tsourakakis, C.E., Kolountzakis, M.N., Miller, G.L.: Triangle sparsifiers. J. Graph Algorithms Appl. 15(6), 703\u2013726 (2011)","journal-title":"J. Graph Algorithms Appl."},{"key":"25_CR27","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C.E., Pachocki, J., Mitzenmacher, M.: Scalable motif-aware graph clustering. In: Proceedings of the 26th International Conference on World Wide Web, pp. 1451\u20131460. International World Wide Web Conferences Steering Committee (2017)","DOI":"10.1145\/3038912.3052653"},{"key":"25_CR28","doi-asserted-by":"crossref","unstructured":"Ugander, J., Backstrom, L., Kleinberg, J.: Subgraph frequencies: mapping the empirical and extremal geography of large graph collections. In: Proceedings of the 22nd International Conference on World Wide Web, pp. 1307\u20131318. ACM (2013)","DOI":"10.1145\/2488388.2488502"},{"issue":"6684","key":"25_CR29","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u2018small-world\u2019 networks. Nature 393(6684), 440 (1998)","journal-title":"Nature"},{"issue":"4","key":"25_CR30","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1109\/TCBB.2006.51","volume":"3","author":"S Wernicke","year":"2006","unstructured":"Wernicke, S.: Efficient detection of network motifs. IEEE\/ACM Trans. Comput. Biol. Bioinform. (TCBB) 3(4), 347\u2013359 (2006)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform. (TCBB)"},{"issue":"9","key":"25_CR31","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"},{"key":"25_CR32","doi-asserted-by":"crossref","unstructured":"Zhao, Z., Wang, G., Butt, A.R., Khan, M., Kumar, V.A., Marathe, M.V.: SAHAD: subgraph analysis in massive networks using hadoop. In: 2012 IEEE 26th International Parallel and Distributed Processing Symposium, pp. 390\u2013401. IEEE (2012)","DOI":"10.1109\/IPDPS.2012.44"}],"container-title":["Lecture Notes in Computer Science","Mathematical Aspects of Computer and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-43120-4_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T00:15:40Z","timestamp":1584490540000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-43120-4_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030431198","9783030431204"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-43120-4_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"18 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MACIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Mathematical Aspects of Computer and Information Sciences","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gebze","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turkey","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":"13 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icmacis2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/macis2019.gtu.edu.tr\/","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":"66","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":"22","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":"14","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":"33% - 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":"2,1","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,8","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)"}}]}}