{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T12:02:17Z","timestamp":1726056137107},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030332228"},{"type":"electronic","value":"9783030332235"}],"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-33223-5_40","type":"book-chapter","created":{"date-parts":[[2019,10,28]],"date-time":"2019-10-28T00:02:24Z","timestamp":1572220944000},"page":"484-497","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Parallel Clique-Like Subgraph Counting and Listing"],"prefix":"10.1007","author":[{"given":"Yi","family":"Yang","sequence":"first","affiliation":[]},{"given":"Da","family":"Yan","sequence":"additional","affiliation":[]},{"given":"Shuigeng","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Guimu","family":"Guo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,10,15]]},"reference":[{"key":"40_CR1","unstructured":"https:\/\/snap.stanford.edu\/data\/web-Google.html"},{"key":"40_CR2","unstructured":"https:\/\/snap.stanford.edu\/data\/com-Youtube.html"},{"key":"40_CR3","unstructured":"https:\/\/snap.stanford.edu\/data\/cit-Patents.html"},{"key":"40_CR4","unstructured":"http:\/\/konect.uni-koblenz.de\/networks\/flixster"},{"key":"40_CR5","unstructured":"https:\/\/snap.stanford.edu\/data\/as-skitter.html"},{"key":"40_CR6","unstructured":"https:\/\/snap.stanford.edu\/data\/wiki-Talk.html"},{"issue":"5","key":"40_CR7","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1145\/324133.324234","volume":"46","author":"RD Blumofe","year":"1999","unstructured":"Blumofe, R.D., Leiserson, C.E.: Scheduling multithreaded computations by work stealing. J. ACM 46(5), 720\u2013748 (1999). \n                      https:\/\/doi.org\/10.1145\/324133.324234","journal-title":"J. ACM"},{"key":"40_CR8","doi-asserted-by":"publisher","unstructured":"Cheng, J., Zhu, L., Ke, Y., Chu, S.: Fast algorithms for maximal clique enumeration with limited memory. In: The 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2012, Beijing, China, 12\u201316 August 2012, pp. 1240\u20131248 (2012). \n                      https:\/\/doi.org\/10.1145\/2339530.2339724","DOI":"10.1145\/2339530.2339724"},{"key":"40_CR9","doi-asserted-by":"publisher","unstructured":"Du, N., Wu, B., Xu, L., Wang, B., Pei, X.: A parallel algorithm for enumerating all maximal cliques in complex network. In: Workshops Proceedings of the 6th IEEE International Conference on Data Mining (ICDM 2006), Hong Kong, China, 18\u201322 December 2006, pp. 320\u2013324 (2006). \n                      https:\/\/doi.org\/10.1109\/ICDMW.2006.17","DOI":"10.1109\/ICDMW.2006.17"},{"key":"40_CR10","unstructured":"Finocchi, I., Finocchi, M., Fusco, E.G.: Counting small cliques in mapreduce. CoRR abs\/1403.0734 (2014). \n                      http:\/\/arxiv.org\/abs\/abs\/1403.0734"},{"key":"40_CR11","doi-asserted-by":"publisher","first-page":"1.7:1","DOI":"10.1145\/2794080","volume":"20","author":"I Finocchi","year":"2015","unstructured":"Finocchi, I., Finocchi, M., Fusco, E.G.: Clique counting in mapreduce: algorithms and experiments. ACM J. Exp. Algorithmics 20, 1.7:1\u20131.7:20 (2015). \n                      https:\/\/doi.org\/10.1145\/2794080","journal-title":"ACM J. Exp. Algorithmics"},{"key":"40_CR12","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-642-27337-7_40","volume-title":"Innovative Computing Technology","author":"A Khosraviani","year":"2011","unstructured":"Khosraviani, A., Sharifi, M.: A distributed algorithm for \n                      \n                        \n                      \n                      $$\\gamma $$\n                    -quasi-clique extractions in massive graphs. In: Pichappan, P., Ahmadi, H., Ariwa, E. (eds.) INCT 2011. CCIS, vol. 241, pp. 422\u2013431. Springer, Heidelberg (2011). \n                      https:\/\/doi.org\/10.1007\/978-3-642-27337-7_40"},{"issue":"2","key":"40_CR13","doi-asserted-by":"publisher","first-page":"026109","DOI":"10.1103\/PhysRevE.78.026109","volume":"78","author":"JM Kumpula","year":"2008","unstructured":"Kumpula, J.M., Kivela, M., Kaski, K., Saramaki, J.: Sequential algorithm for fast clique percolation. Phys. Rev. E Stat. Nonlinear Soft Matter Phys. 78(2), 026109 (2008)","journal-title":"Phys. Rev. E Stat. Nonlinear Soft Matter Phys."},{"issue":"3","key":"40_CR14","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1145\/2402.322385","volume":"30","author":"DW Matula","year":"1983","unstructured":"Matula, D.W., Beck, L.L.: Smallest-last ordering and clustering and graph coloring algorithms. J. ACM 30(3), 417\u2013427 (1983). \n                      https:\/\/doi.org\/10.1145\/2402.322385","journal-title":"J. ACM"},{"issue":"2","key":"40_CR15","doi-asserted-by":"publisher","first-page":"25:1","DOI":"10.1145\/2818185","volume":"48","author":"RR McCune","year":"2015","unstructured":"McCune, R.R., Weninger, T., Madey, G.: Thinking like a vertex: a survey of vertex-centric frameworks for large-scale distributed graph processing. ACM Comput. Surv. 48(2), 25:1\u201325:39 (2015). \n                      https:\/\/doi.org\/10.1145\/2818185","journal-title":"ACM Comput. Surv."},{"key":"40_CR16","doi-asserted-by":"publisher","unstructured":"Michael, M.M., Scott, M.L.: Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In: Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, Philadelphia, Pennsylvania, USA, 23\u201326 May 1996, pp. 267\u2013275 (1996). \n                      https:\/\/doi.org\/10.1145\/248052.248106","DOI":"10.1145\/248052.248106"},{"key":"40_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-642-13193-6_2","volume-title":"Experimental Algorithms","author":"PM Pardalos","year":"2010","unstructured":"Pardalos, P.M., Rebennack, S.: Computational challenges with cliques, quasi-cliques and clique partitions in graphs. In: Festa, P. (ed.) SEA 2010. LNCS, vol. 6049, pp. 13\u201322. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-13193-6_2"},{"issue":"3","key":"40_CR18","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF01098364","volume":"4","author":"PM Pardalos","year":"1994","unstructured":"Pardalos, P.M., Xue, J.: The maximum clique problem. J. Global Optim. 4(3), 301\u2013328 (1994)","journal-title":"J. Global Optim."},{"key":"40_CR19","doi-asserted-by":"publisher","unstructured":"Ribeiro, P.M.P., Silva, F.M.A., Lopes, L.M.B.: Efficient parallel subgraph counting using G-tries. In: Proceedings of the 2010 IEEE International Conference on Cluster Computing, Heraklion, Crete, Greece, 20\u201324 September 2010, pp. 217\u2013226 (2010). \n                      https:\/\/doi.org\/10.1109\/CLUSTER.2010.27","DOI":"10.1109\/CLUSTER.2010.27"},{"issue":"4","key":"40_CR20","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/j.jpdc.2009.01.003","volume":"69","author":"MC Schmidt","year":"2009","unstructured":"Schmidt, M.C., Samatova, N.F., Thomas, K., Park, B.: A scalable, parallel algorithm for maximal clique enumeration. J. Parallel Distrib. Comput. 69(4), 417\u2013428 (2009). \n                      https:\/\/doi.org\/10.1016\/j.jpdc.2009.01.003","journal-title":"J. Parallel Distrib. Comput."},{"key":"40_CR21","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.jpdc.2014.08.011","volume":"79\u201380","author":"M Svendsen","year":"2015","unstructured":"Svendsen, M., Mukherjee, A.P., Tirthapura, S.: Mining maximal cliques from a large graph using mapreduce: tackling highly uneven subproblem sizes. J. Parallel Distrib. Comput. 79\u201380, 104\u2013114 (2015). \n                      https:\/\/doi.org\/10.1016\/j.jpdc.2014.08.011","journal-title":"J. Parallel Distrib. Comput."},{"key":"40_CR22","doi-asserted-by":"publisher","unstructured":"Tsourakakis, C.E., Bonchi, F., Gionis, A., Gullo, F., Tsiarli, M.A.: Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees. In: The 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2013, Chicago, IL, USA, 11\u201314 August 2013, pp. 104\u2013112 (2013). \n                      https:\/\/doi.org\/10.1145\/2487575.2487645","DOI":"10.1145\/2487575.2487645"},{"key":"40_CR23","doi-asserted-by":"publisher","unstructured":"Wu, B., Yang, S., Zhao, H., Wang, B.: A distributed algorithm to enumerate all maximal cliques in mapreduce. In: Fourth International Conference on Frontier of Computer Science and Technology, FCST 2009, Shanghai, China, 17\u201319 December 2009, pp. 45\u201351 (2009). \n                      https:\/\/doi.org\/10.1109\/FCST.2009.30","DOI":"10.1109\/FCST.2009.30"},{"key":"40_CR24","doi-asserted-by":"publisher","unstructured":"Xiang, J., Guo, C., Aboulnaga, A.: Scalable maximum clique computation using mapreduce. In: 29th IEEE International Conference on Data Engineering, ICDE 2013, Brisbane, Australia, 8\u201312 April 2013, pp. 74\u201385 (2013). \n                      https:\/\/doi.org\/10.1109\/ICDE.2013.6544815","DOI":"10.1109\/ICDE.2013.6544815"},{"issue":"1","key":"40_CR25","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1109\/TSC.2015.2479225","volume":"9","author":"Y Xu","year":"2016","unstructured":"Xu, Y., Cheng, J., Fu, A.W.: Distributed maximal clique computation and management. IEEE Trans. Serv. Comput. 9(1), 110\u2013122 (2016). \n                      https:\/\/doi.org\/10.1109\/TSC.2015.2479225","journal-title":"IEEE Trans. Serv. Comput."},{"key":"40_CR26","doi-asserted-by":"publisher","unstructured":"Xu, Y., Cheng, J., Fu, A.W., Bu, Y.: Distributed maximal clique computation. In: 2014 IEEE International Congress on Big Data, Anchorage, AK, USA, 27 June\u20132 July 2014, pp. 160\u2013167 (2014). \n                      https:\/\/doi.org\/10.1109\/BigData.Congress.2014.31","DOI":"10.1109\/BigData.Congress.2014.31"},{"issue":"1\u20132","key":"40_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/1900000056","volume":"7","author":"D Yan","year":"2017","unstructured":"Yan, D., Bu, Y., Tian, Y., Deshpande, A.: Big graph analytics platforms. Found. Trends Databases 7(1\u20132), 1\u2013195 (2017). \n                      https:\/\/doi.org\/10.1561\/1900000056","journal-title":"Found. Trends Databases"}],"container-title":["Lecture Notes in Computer Science","Conceptual Modeling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-33223-5_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,28]],"date-time":"2019-10-28T00:06:43Z","timestamp":1572221203000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-33223-5_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030332228","9783030332235"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-33223-5_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"15 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ER","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Conceptual Modeling","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Salvador","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazil","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":"4 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"38","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"er2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.inf.ufrgs.br\/er2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}