{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T17:13:03Z","timestamp":1662657183177},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2022,7,30]],"date-time":"2022-07-30T00:00:00Z","timestamp":1659139200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,7,30]],"date-time":"2022-07-30T00:00:00Z","timestamp":1659139200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"NSERC Canada Discovery Grant","award":["RGPIN-2017-04039","RGPIN-2016-04022"],"award-info":[{"award-number":["RGPIN-2017-04039","RGPIN-2016-04022"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib Parallel Databases"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s10619-022-07416-8","type":"journal-article","created":{"date-parts":[[2022,7,30]],"date-time":"2022-07-30T14:02:42Z","timestamp":1659189762000},"page":"335-372","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Four node graphlet and triad enumeration on distributed platforms"],"prefix":"10.1007","volume":"40","author":[{"given":"Yudi","family":"Santoso","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaozhou","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesh","family":"Srinivasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Thomo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,7,30]]},"reference":[{"issue":"suppl\u20131","key":"7416_CR1","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1093\/bioinformatics\/bti1049","volume":"21","author":"H Hu","year":"2005","unstructured":"Hu, H., Yan, X., Huang, Y., Han, J., Zhou, X.J.: Mining coherent dense subgraphs across massive biological networks for functional discovery. Bioinformatics 21(suppl\u20131), 213\u2013221 (2005)","journal-title":"Bioinformatics"},{"key":"7416_CR2","doi-asserted-by":"publisher","first-page":"680","DOI":"10.4137\/CIN.S680","volume":"6","author":"T Milenkovi\u0107","year":"2008","unstructured":"Milenkovi\u0107, T., Pr\u017eulj, N.: Uncovering biological network function via graphlet degree signatures. Cancer Inf. 6, 680 (2008)","journal-title":"Cancer Inf."},{"issue":"8","key":"7416_CR3","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1109\/TKDE.2005.127","volume":"17","author":"M Deshpande","year":"2005","unstructured":"Deshpande, M., Kuramochi, M., Wale, N., Karypis, G.: Frequent substructure-based approaches for classifying chemical compounds. IEEE Trans. Knowl. Data Eng. 17(8), 1036\u20131050 (2005)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"8","key":"7416_CR4","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1016\/j.neunet.2005.07.009","volume":"18","author":"L Ralaivola","year":"2005","unstructured":"Ralaivola, L., Swamidass, S.J., Saigo, H., Baldi, P.: Graph kernels for chemical informatics. Neural Netw. 18(8), 1093\u20131110 (2005)","journal-title":"Neural Netw."},{"issue":"3","key":"7416_CR5","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":"7416_CR6","doi-asserted-by":"crossref","unstructured":"Br\u00f6cheler, M., Pugliese, A., Subrahmanian, V.S.: Cosi: Cloud oriented subgraph identification in massive social networks. In: Proceedings of the 2010 International Conference on Advances in Social Networks Analysis and Mining, pp. 248\u2013255. IEEE (2010)","DOI":"10.1109\/ASONAM.2010.80"},{"issue":"2\u20133","key":"7416_CR7","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1002\/pmic.201400233","volume":"15","author":"SW Wong","year":"2015","unstructured":"Wong, S.W., Cercone, N., Jurisica, I.: Comparative network analysis via differential graphlet communities. Proteomics 15(2\u20133), 608\u2013617 (2015)","journal-title":"Proteomics"},{"key":"7416_CR8","unstructured":"Santoso, Y., Srinivasan, V., Thomo, A.: Efficient enumeration of four node graphlets at trillion-scale. In: Proceedings of the 23rd EDBT, pp. 439\u2013442 (2020)"},{"key":"7416_CR9","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":"2","key":"7416_CR10","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"ME Newman","year":"2003","unstructured":"Newman, M.E.: The structure and function of complex networks. SIAM Rev. 45(2), 167\u2013256 (2003)","journal-title":"SIAM Rev."},{"issue":"9","key":"7416_CR11","doi-asserted-by":"publisher","first-page":"812","DOI":"10.14778\/2311906.2311909","volume":"5","author":"J Wang","year":"2012","unstructured":"Wang, J., Cheng, J.: Truss decomposition in massive networks. Proc. VLDB Endow. 5(9), 812 (2012)","journal-title":"Proc. VLDB Endow."},{"key":"7416_CR12","doi-asserted-by":"crossref","unstructured":"Park, H.-M., Myaeng, S.-H., Kang, U.: Pte: enumerating trillion triangles on distributed systems. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1115\u20131124 (2016)","DOI":"10.1145\/2939672.2939757"},{"issue":"4","key":"7416_CR13","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"},{"issue":"10","key":"7416_CR14","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."},{"issue":"11","key":"7416_CR15","doi-asserted-by":"publisher","first-page":"1651","DOI":"10.14778\/3342263.3342640","volume":"12","author":"M Bressan","year":"2019","unstructured":"Bressan, M., Leucci, S., Panconesi, A.: Motivo: fast motif counting via succinct color coding and adaptive sampling. Proc. VLDB Endow. 12(11), 1651\u20131663 (2019)","journal-title":"Proc. VLDB Endow."},{"key":"7416_CR16","unstructured":"McSherry, F., Isard, M., Murray, D.G.: Scalability! but at what $$\\{\\text{COST}\\}$$? In: Proceedings of the 15th Workshop on Hot Topics in Operating Systems (HotOS $$\\{\\text{ XV }\\}$$) (2015)"},{"issue":"6","key":"7416_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3237191","volume":"12","author":"H-M Park","year":"2018","unstructured":"Park, H.-M., Silvestri, F., Pagh, R., Chung, C.-W., Myaeng, S.-H., Kang, U.: Enumerating trillion subgraphs on distributed systems. ACM Trans. Knowl. Discov. Data (TKDD) 12(6), 1\u201330 (2018)","journal-title":"ACM Trans. Knowl. Discov. Data (TKDD)"},{"issue":"3\u20135","key":"7416_CR18","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/j.disc.2005.09.051","volume":"307","author":"V Batagelj","year":"2007","unstructured":"Batagelj, V., Zaver\u0161nik, M.: Short cycle connectivity. Discret. Math. 307(3\u20135), 310\u2013318 (2007)","journal-title":"Discret. Math."},{"key":"7416_CR19","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.physa.2013.09.010","volume":"394","author":"BM Tabak","year":"2014","unstructured":"Tabak, B.M., Takami, M., Rocha, J.M., Cajueiro, D.O., Souza, S.R.: Directed clustering coefficient as a measure of systemic risk in complex banking networks. Physica A 394, 211\u2013216 (2014)","journal-title":"Physica A"},{"key":"7416_CR20","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, vol. 8. Cambridge University Press, Cambridge (1994)"},{"key":"7416_CR21","unstructured":"Santoso, Y., Srinivasan, V., Thomo, A., Chester, S.: Triad enumeration at trillion-scale using a single commodity machine. In: Proceedings of the 22nd EDBT (2019)"},{"key":"7416_CR22","doi-asserted-by":"publisher","unstructured":"Schank, T., Wagner, D.: Finding, counting and listing all triangles in large graphs, an experimental study. In: Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, WEA 2005, Santorini Island, Greece, May 10\u201313, 2005, Proceedings, pp. 606\u2013609 (2005). https:\/\/doi.org\/10.1007\/11427186_54","DOI":"10.1007\/11427186_54"},{"issue":"1\u20133","key":"7416_CR23","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1016\/j.tcs.2008.07.017","volume":"407","author":"M Latapy","year":"2008","unstructured":"Latapy, M.: Main-memory triangle computations for very large (sparse (power-law)) graphs. Theor. Comput. Sci. 407(1\u20133), 458\u2013473 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"7416_CR24","doi-asserted-by":"crossref","unstructured":"Ahmed, N.K., Neville, J., Rossi, R.A., Duffield, N.: Efficient graphlet counting for large networks. In: Proceedings of the 2015 IEEE International Conference on Data Mining. IEEE, pp. 1\u201310 (2015)","DOI":"10.1109\/ICDM.2015.141"},{"key":"7416_CR25","doi-asserted-by":"crossref","unstructured":"Bressan, M., Chierichetti, F., Kumar, R., Leucci, S., Panconesi, A.: Counting graphlets: Space vs time. In: Proceedings of the Tenth ACM International Conference on Web Search and Data Mining. ACM, pp. 557\u2013566 (2017)","DOI":"10.1145\/3018661.3018732"},{"issue":"9","key":"7416_CR26","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":"2","key":"7416_CR27","doi-asserted-by":"publisher","first-page":"810","DOI":"10.1016\/j.comnet.2011.08.019","volume":"56","author":"D Marcus","year":"2012","unstructured":"Marcus, D., Shavitt, Y.: Rage-a rapid graphlet enumerator for large networks. Comput. Netw. 56(2), 810\u2013819 (2012)","journal-title":"Comput. Netw."},{"key":"7416_CR28","doi-asserted-by":"crossref","unstructured":"Danisch, M., Balalau, O., Sozio, M.: Listing k-cliques in sparse real-world graphs. In: Proceedings of the 2018 World Wide Web Conference on World Wide Web. International World Wide Web Conferences Steering Committee, pp. 589\u2013598 (2018)","DOI":"10.1145\/3178876.3186125"},{"key":"7416_CR29","doi-asserted-by":"publisher","unstructured":"Suri, S., Vassilvitskii, S.: Counting triangles and the curse of the last reducer. In: Proceedings of the 20th International Conference on World Wide Web. WWW \u201911. ACM, New York, NY, USA, pp. 607\u2013614 (2011). https:\/\/doi.org\/10.1145\/1963405.1963491","DOI":"10.1145\/1963405.1963491"},{"issue":"10","key":"7416_CR30","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":"7416_CR31","doi-asserted-by":"crossref","unstructured":"Teixeira, C.H., Fonseca, A.J., Serafini, M., Siganos, G., Zaki, M.J., Aboulnaga, A.: Arabesque: a system for distributed graph mining. In: Proceedings of the 25th Symposium on Operating Systems Principles. ACM, pp. 425\u2013440 (2015)","DOI":"10.1145\/2815400.2815410"},{"key":"7416_CR32","doi-asserted-by":"crossref","unstructured":"Dias, V., Teixeira, C.H., Guedes, D., Meira, W., Parthasarathy, S.: Fractal: A general-purpose graph pattern mining system. In: Proceedings of the 2019 International Conference on Management of Data, pp. 1357\u20131374 (2019)","DOI":"10.1145\/3299869.3319875"},{"issue":"5","key":"7416_CR33","doi-asserted-by":"publisher","first-page":"1024","DOI":"10.1007\/s10618-016-0466-x","volume":"30","author":"N Talukder","year":"2016","unstructured":"Talukder, N., Zaki, M.J.: A distributed approach for graph mining in massive networks. Data Min. Knowl. Disc. 30(5), 1024\u20131052 (2016)","journal-title":"Data Min. Knowl. Disc."},{"key":"7416_CR34","unstructured":"Mawhirter, D., Reinehr, S., Holmes, C., Liu, T., Wu, B.: Graphzero: breaking symmetry for efficient graph mining. arXiv:1911.12877 (2019)"},{"key":"7416_CR35","doi-asserted-by":"crossref","unstructured":"Chen, H., Liu, M., Zhao, Y., Yan, X., Yan, D., Cheng, J.: G-miner: an efficient task-oriented graph mining system. In: Proceedings of the Thirteenth EuroSys Conference, pp. 1\u201312 (2018)","DOI":"10.1145\/3190508.3190545"},{"key":"7416_CR36","doi-asserted-by":"crossref","unstructured":"Yan, D., Guo, G., Chowdhury, M.M.R., \u00d6zsu, M.T., Ku, W.-S., Lui, J.C.: G-thinker: a distributed framework for mining subgraphs in a big graph. In: 2020 IEEE 36th International Conference on Data Engineering (ICDE). IEEE, pp. 1369\u20131380 (2020)","DOI":"10.1109\/ICDE48307.2020.00122"},{"key":"7416_CR37","doi-asserted-by":"crossref","unstructured":"Ren, X., Wang, J., Han, W.-S., Yu, J.X.: Fast and robust distributed subgraph enumeration. arXiv:1901.07747 (2019)","DOI":"10.14778\/3342263.3342272"},{"issue":"12","key":"7416_CR38","doi-asserted-by":"publisher","first-page":"2493","DOI":"10.14778\/3407790.3407840","volume":"13","author":"H Zhang","year":"2020","unstructured":"Zhang, H., Yu, J.X., Zhang, Y., Zhao, K., Cheng, H.: Distributed subgraph counting: a general approach. Proc. VLDB Endow. 13(12), 2493\u20132507 (2020)","journal-title":"Proc. VLDB Endow."},{"issue":"3","key":"7416_CR39","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0378-8733(01)00035-1","volume":"23","author":"V Batagelj","year":"2001","unstructured":"Batagelj, V., Mrvar, A.: A subquadratic triad census algorithm for large sparse networks with small maximum degree. Soc. Netw. 23(3), 237\u2013243 (2001)","journal-title":"Soc. Netw."},{"key":"7416_CR40","doi-asserted-by":"crossref","unstructured":"Chin Jr, G., Marquez, A., Choudhury, S., Feo, J.: Scalable triadic analysis of large-scale graphs: Multi-core vs. multi-processor vs. multi-threaded shared memory architectures. In: Proceedings of the 2012 IEEE 24th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD). IEEE, pp. 163\u2013170 (2012)","DOI":"10.1109\/SBAC-PAD.2012.39"},{"key":"7416_CR41","doi-asserted-by":"crossref","unstructured":"Parimalarangan, S., Slota, G.M., Madduri, K.: Fast parallel graph triad census and triangle counting on shared-memory platforms. In: Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW). IEEE, pp. 1500\u20131509 (2017)","DOI":"10.1109\/IPDPSW.2017.144"},{"key":"7416_CR42","first-page":"218","volume":"2","author":"JA Davis","year":"1972","unstructured":"Davis, J.A., Leinhardt, S.: The structure of positive interpersonal relations in small groups. Sociol. Theor. Prog. 2, 218\u2013251 (1972)","journal-title":"Sociol. Theor. Prog."},{"key":"7416_CR43","first-page":"5","volume":"4","author":"C Seshadhri","year":"2013","unstructured":"Seshadhri, C., Pinar, A., Kolda, T.G.: Fast triangle counting through wedge sampling. Proc. SIAM Conf. Data Min. 4, 5 (2013)","journal-title":"Proc. SIAM Conf. Data Min."},{"issue":"2","key":"7416_CR44","doi-asserted-by":"publisher","first-page":"162","DOI":"10.14778\/3149193.3149197","volume":"11","author":"P Wang","year":"2017","unstructured":"Wang, P., Qi, Y., Sun, Y., Zhang, X., Tao, J., Guan, X.: Approximately counting triangles in large graph streams including edge duplicates with a fixed memory usage. Proc. VLDB Endow. 11(2), 162\u2013175 (2017)","journal-title":"Proc. VLDB Endow."},{"key":"7416_CR45","unstructured":"Santoso, Y.: Triangle counting and listing in directed and undirected graphs using single machines. Master\u2019s thesis, University of Victoria (2018)"},{"key":"7416_CR46","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: The WebGraph framework I: Compression techniques. In: Proceedings of the Thirteenth International World Wide Web Conference (WWW 2004). ACM Press, Manhattan, USA, pp. 595\u2013601 (2004)","DOI":"10.1145\/988672.988752"}],"container-title":["Distributed and Parallel Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10619-022-07416-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10619-022-07416-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10619-022-07416-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T16:34:58Z","timestamp":1662654898000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10619-022-07416-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,30]]},"references-count":46,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["7416"],"URL":"https:\/\/doi.org\/10.1007\/s10619-022-07416-8","relation":{},"ISSN":["0926-8782","1573-7578"],"issn-type":[{"value":"0926-8782","type":"print"},{"value":"1573-7578","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,30]]},"assertion":[{"value":"21 June 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 July 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}