{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T04:58:37Z","timestamp":1755838717280,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319969824"},{"type":"electronic","value":"9783319969831"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-96983-1_50","type":"book-chapter","created":{"date-parts":[[2018,7,31]],"date-time":"2018-07-31T15:50:06Z","timestamp":1533052206000},"page":"703-717","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Improved Distributed Algorithm for Graph Truss Decomposition"],"prefix":"10.1007","author":[{"given":"Venkatesan T.","family":"Chakaravarthy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aashish","family":"Goyal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prakash","family":"Murali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shivmaran S.","family":"Pandian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yogish","family":"Sabharwal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,1]]},"reference":[{"key":"50_CR1","unstructured":"Cohen, J.: Trusses: cohesive subgraphs for social network analysis. Technical report, National Security Agency (2008)"},{"issue":"11","key":"50_CR2","doi-asserted-by":"publisher","first-page":"3304","DOI":"10.1093\/ietfec\/e91-a.11.3304","volume":"91","author":"K Saito","year":"2008","unstructured":"Saito, K., Yamada, T., Kazama, K.: Extracting communities from complex networks by the k-dense method. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91(11), 3304\u20133311 (2008)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"50_CR3","unstructured":"Alvarez-Hamelin, J., Dall\u2019Asta, L., Barrat, A., Vespignani, A.: Large scale networks fingerprinting and visualization using the k-core decomposition. In: NIPS (2005)"},{"issue":"4","key":"50_CR4","doi-asserted-by":"publisher","first-page":"276","DOI":"10.14778\/2856318.2856323","volume":"9","author":"X Huang","year":"2015","unstructured":"Huang, X., Lakshmanan, L., Yu, J., Cheng, H.: Approximate closest community search in networks. Proc. VLDB Endow. 9(4), 276\u2013287 (2015)","journal-title":"Proc. VLDB Endow."},{"issue":"3","key":"50_CR5","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"S Seidman","year":"1983","unstructured":"Seidman, S.: Network structure and minimum degree. Soc. Netw. 5(3), 269\u2013287 (1983)","journal-title":"Soc. Netw."},{"key":"50_CR6","doi-asserted-by":"crossref","unstructured":"Sariyuce, A., Seshadhri, C., Pinar, A., Catalyurek, U.: Finding the hierarchy of dense subgraphs using nucleus decompositions. In: WWW (2015)","DOI":"10.2172\/1172917"},{"issue":"9","key":"50_CR7","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\u2013823 (2012)","journal-title":"Proc. VLDB Endow."},{"key":"50_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-319-06608-0_26","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"RA Rossi","year":"2014","unstructured":"Rossi, R.A.: Fast triangle core decomposition for mining large graphs. In: Tseng, V.S., Ho, T.B., Zhou, Z.-H., Chen, A.L.P., Kao, H.-Y. (eds.) PAKDD 2014. LNCS (LNAI), vol. 8443, pp. 310\u2013322. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06608-0_26"},{"key":"50_CR9","doi-asserted-by":"crossref","unstructured":"Smith, S., Liu, X., Ahmed, N., Tom, A., Petrini, F., Karypis, G.: Truss decompositions on shared-memory parallel systems. In: HPEC (2017)","DOI":"10.1109\/HPEC.2017.8091049"},{"key":"50_CR10","doi-asserted-by":"crossref","unstructured":"Kabir, H., Madduri, K.: Shared-memory graph truss decomposition. In: HiPC (2017)","DOI":"10.1109\/HiPC.2017.00012"},{"key":"50_CR11","doi-asserted-by":"crossref","unstructured":"Kabir, H., Madduri, K.: Parallel k-truss decomposition on multicore systems. In: HPEC (2017)","DOI":"10.1109\/HPEC.2017.8091052"},{"key":"50_CR12","doi-asserted-by":"crossref","unstructured":"Voegele, C., Lu, Y., Pai, S., Pingali, K.: Parallel triangle counting and k-truss identification using graph-centric methods. In: HPEC (2017)","DOI":"10.1109\/HPEC.2017.8091037"},{"key":"50_CR13","doi-asserted-by":"crossref","unstructured":"Green, O., et al.: Quickly finding a truss in a haystack. In: HPEC (2017)","DOI":"10.1109\/HPEC.2017.8091038"},{"key":"50_CR14","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Parthasarathy, S.: Extracting analyzing and visualizing triangle k-core motifs within networks. In: ICDE (2012)","DOI":"10.1109\/ICDE.2012.35"},{"key":"50_CR15","doi-asserted-by":"crossref","unstructured":"Chen, P., Chou, C., Chen, M.: Distributed algorithms for k-truss decomposition. In: IEEE International Conference on Big Data (2014)","DOI":"10.1109\/BigData.2014.7004264"},{"issue":"4","key":"50_CR16","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/MCSE.2009.120","volume":"11","author":"J Cohen","year":"2009","unstructured":"Cohen, J.: Graph twiddling in a MapReduce world. Comput. Sci. Eng. 11(4), 29\u201341 (2009)","journal-title":"Comput. Sci. Eng."},{"key":"50_CR17","doi-asserted-by":"crossref","unstructured":"Shao, Y., Chen, L., Cui, B.: Efficient cohesive subgraphs detection in parallel. In: SIGMOD (2014)","DOI":"10.1145\/2588555.2593665"},{"issue":"5","key":"50_CR18","doi-asserted-by":"publisher","first-page":"S48","DOI":"10.1137\/13090729X","volume":"36","author":"T Kolda","year":"2014","unstructured":"Kolda, T., Pinar, A., Plantenga, T., Seshadhri, C., Task, C.: Counting triangles in massive graphs with MapReduce. SIAM J. Sci. Comput. 36(5), S48\u2013S77 (2014)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"50_CR19","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/S0196-6774(03)00076-2","volume":"49","author":"U Meyer","year":"2003","unstructured":"Meyer, U., Sandersr, P.: $$\\Delta $$-stepping: a parallelizable shortest path algorithm. J. Algorithms 49(1), 114\u2013152 (2003)","journal-title":"J. Algorithms"},{"key":"50_CR20","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: The webgraph framework i: compression techniques. In: WWW (2004)","DOI":"10.1145\/988672.988752"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2018: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-96983-1_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T01:09:20Z","timestamp":1659316160000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-96983-1_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319969824","9783319969831"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-96983-1_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"1 August 2018","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":"Turin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/europar2018.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}