{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:37:03Z","timestamp":1743089823888,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030953874"},{"type":"electronic","value":"9783030953881"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-030-95388-1_13","type":"book-chapter","created":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T08:20:55Z","timestamp":1645518055000},"page":"193-212","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A NUMA-Aware Parallel Truss Decomposition Algorithm for Large Scale Graphs"],"prefix":"10.1007","author":[{"given":"Zhebin","family":"Mou","sequence":"first","affiliation":[]},{"given":"Nong","family":"Xiao","sequence":"additional","affiliation":[]},{"given":"Zhiguang","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,23]]},"reference":[{"key":"13_CR1","unstructured":"Gcc atomic built-ins. https:\/\/gcc.gnu.org\/onlinedocs\/gcc-4.1.1\/gcc\/Atomic-Builtins.html. Accessed 2021"},{"key":"13_CR2","unstructured":"Numactl documentation. https:\/\/github.com\/numactl\/numactl. Accessed 2021"},{"key":"13_CR3","unstructured":"Openmp documentation. https:\/\/www.openmp.org\/. Accessed 2021"},{"issue":"11","key":"13_CR4","doi-asserted-by":"publisher","first-page":"1298","DOI":"10.14778\/3137628.3137640","volume":"10","author":"E Akbas","year":"2017","unstructured":"Akbas, E., Peixiang, Z.: Truss-based community search: a truss-equivalence based indexing approach. Proc. VLDB Endowment 10(11), 1298\u20131309 (2017)","journal-title":"Proc. VLDB Endowment"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Almasri, M., Anjum, O., Pearson, C., Qureshi, Z., Hwu, W.M.: Update on k-truss decomposition on GPU. In: 2019 IEEE High Performance Extreme Computing Conference (HPEC) (2019)","DOI":"10.1109\/HPEC.2019.8916285"},{"issue":"6","key":"13_CR6","first-page":"34","volume":"1","author":"V Batagelj","year":"2003","unstructured":"Batagelj, V., Zaver\u0161nik, M.: An o(m) algorithm for cores decomposition of networks. Comput. Sci. 1(6), 34\u201337 (2003)","journal-title":"Comput. Sci."},{"issue":"1","key":"13_CR7","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0214017","volume":"14","author":"N Chiba","year":"1985","unstructured":"Chiba, N., Nishizeki, T.: Arboricity and subgraph listing algorithms. SIAM J. Comput. 14(1), 210\u2013223 (1985)","journal-title":"SIAM J. Comput."},{"key":"13_CR8","unstructured":"Cohen, J.: Trusses: Cohesive subgraphs for social network analysis. National security agency technical report 16(3.1) (2008)"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Diab, S., Olabi, M.G., Hajj, I.E.: Ktrussexplorer: exploring the design space of k-truss decomposition optimizations on GPUs. In: 2020 IEEE High Performance Extreme Computing Conference, HPEC 2020, Waltham, MA, USA, 22\u201324 September, 2020, pp. 1\u20138. IEEE (2020)","DOI":"10.1109\/HPEC43674.2020.9286165"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Gui, C., Zheng, L., Yao, P., Liao, X., Jin, H.: Fast triangle counting on GPU. In: 2019 IEEE High Performance Extreme Computing Conference, HPEC 2019, Waltham, MA, USA, 24\u201326 September, 2019, pp. 1\u20137. IEEE (2019)","DOI":"10.1109\/HPEC.2019.8916216"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Huang, X., Cheng, H., Qin, L., Tian, W., Yu, J.X.: Querying k-truss community in large and dynamic graphs. In: Dyreson, C.E., Li, F., \u00d6zsu, M.T. (eds.) International Conference on Management of Data, SIGMOD 2014, Snowbird, UT, USA, 22\u201327 June, 2014, pp. 1311\u20131322. ACM (2014)","DOI":"10.1145\/2588555.2610495"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Kabir, H., Madduri, K.: Parallel k-truss decomposition on multicore systems. In: 2017 IEEE High Performance Extreme Computing Conference (HPEC) (2017)","DOI":"10.1109\/HPEC.2017.8091052"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Kabir, H., Madduri, K.: Shared-memory graph truss decomposition. In: 2017 IEEE 24th International Conference on High Performance Computing (HiPC), pp. 13\u201322 (2017)","DOI":"10.1109\/HiPC.2017.00012"},{"key":"13_CR14","unstructured":"Kaiyuan, Z., Haibo, C.: Numa-aware graph-structured analytics. Acm Sigplan Notices A Monthly Publication of the Special Interest Group on Programming Languages (2015)"},{"key":"13_CR15","unstructured":"Leskovec, J., Krevl, A.: Snap datasets: Stanford large network dataset collection, June 2014. http:\/\/snap.stanford.edu\/data. Accessed 2021"},{"issue":"2","key":"13_CR16","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02289199","volume":"15","author":"RD Luce","year":"1950","unstructured":"Luce, R.D.: Connectivity and generalized cliques in sociometric group structure. Psychometrika 15(2), 169 (1950)","journal-title":"Psychometrika"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Mailthody, V.S., Date, K., Qureshi, Z., Pearson, C., Hwu, W.M.: Collaborative (cpu + gpu) algorithms for triangle counting and truss decomposition. In: 2018 IEEE High Performance extreme Computing Conference (HPEC) (2018)","DOI":"10.1109\/HPEC.2018.8547517"},{"issue":"1","key":"13_CR18","first-page":"458","volume":"407","author":"L Matthieu","year":"2008","unstructured":"Matthieu, L.: Main-memory triangle computations for very large (sparse (power-law)) graphs. Theoret. Comput. Sci. 407(1), 458\u2013473 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Ouyang, Z., Wu, S., Zhao, T., Yue, D., Zhang, T.: Memory-efficient GPU-based exact and parallel triangle counting in large graphs, pp. 2195\u20132199, August 2019","DOI":"10.1109\/HPCC\/SmartCity\/DSS.2019.00304"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Pearce, R.: Triangle counting for scale-free graphs at scale in distributed memory. In: 2017 IEEE High Performance Extreme Computing Conference (HPEC) (2017)","DOI":"10.1109\/HPEC.2017.8091051"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Pei, J., Jiang, D., Zhang, A.: On mining cross-graph quasi-cliques. In: Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, pp. 228\u2013238 (2005)","DOI":"10.1145\/1081870.1081898"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Rossi, R.A.: Fast triangle core decomposition for mining large graphs. In: Pacific-asia Conference on Knowledge Discovery & Data Mining (2014)","DOI":"10.1007\/978-3-319-06608-0_26"},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"Samsi, S., et al.: Static graph challenge: subgraph isomorphism, pp. 1\u20136, September 2017","DOI":"10.1109\/HPEC.2017.8091039"},{"key":"13_CR24","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 (2015)","DOI":"10.1145\/2736277.2741640"},{"issue":"1","key":"13_CR25","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1080\/0022250X.1978.9989883","volume":"6","author":"S Seidman","year":"1978","unstructured":"Seidman, S., Foster, B.: A graph-theoretic generalization of the clique concept*. J. Math. Sociol. 6(1), 139\u2013154 (1978)","journal-title":"J. Math. Sociol."},{"key":"13_CR26","doi-asserted-by":"crossref","unstructured":"Shang, H., Tao, Y., Gao, Y., Zhang, C., Wang, X.: An improved invariant for matching molecular graphs based on vf2 algorithm. IEEE Trans. Syst. Man Cybern. Syst. 45, 122\u2013128 (2015)","DOI":"10.1109\/TSMC.2014.2327058"},{"key":"13_CR27","doi-asserted-by":"crossref","unstructured":"Smith, S., Xing, L., Ahmed, N.K., Tom, A.S., Karypis, G.: Truss decomposition on shared-memory parallel systems. In: 2017 IEEE High Performance Extreme Computing Conference (HPEC) (2017)","DOI":"10.1109\/HPEC.2017.8091049"},{"key":"13_CR28","doi-asserted-by":"crossref","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 2011, Hyderabad, India, 28 March\u20131 April, 2011, pp. 607\u2013614. ACM (2011)","DOI":"10.1145\/1963405.1963491"},{"key":"13_CR29","doi-asserted-by":"crossref","unstructured":"Tom, A.S., Sundaram, N., Ahmed, N.K., Smith, S., Karypis, G.: Exploring optimizations on shared-memory platforms for parallel triangle counting algorithms. In: High Performance Extreme Computing Conference (2017)","DOI":"10.1109\/HPEC.2017.8091054"},{"key":"13_CR30","doi-asserted-by":"crossref","unstructured":"Voegele, C., Lu, Y.S., Pai, S., Pingali, K.: Parallel triangle counting and k-truss identification using graph-centric methods. In: 2017 IEEE High Performance Extreme Computing Conference (HPEC) (2017)","DOI":"10.1109\/HPEC.2017.8091037"},{"issue":"9","key":"13_CR31","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":"13_CR32","doi-asserted-by":"crossref","unstructured":"Wu, J., Goshulak, A., Srinivasan, V., Thomo, A.: K-truss decomposition of large networks on a single consumer-grade machine. In: IEEE\/ACM 2018 International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2018, Barcelona, Spain, 28\u201331 August, 2018 (2018)","DOI":"10.1109\/ASONAM.2018.8508642"},{"key":"13_CR33","doi-asserted-by":"crossref","unstructured":"Yang, L., Hao, F., Li, S., Min, G., Kim, H.C., Yau, S.: An efficient approach to generating location-sensitive recommendations in ad-hoc social network environments. IEEE Trans. Serv. Comput. 8, 1 (2015)","DOI":"10.1109\/TSC.2015.2401833"},{"key":"13_CR34","unstructured":"Yulin, C., Zhuohang, L., Shixuan, S., Qiong, L., Yue, W.: Accelerating all-edge common neighbor counting on three processors. In: Proceedings of the 48th International Conference on Parallel Processing, ICPP 2019, Kyoto, Japan, 05\u201308 August, 2019, pp. 42:1\u201342:10. ACM (2019)"},{"issue":"10","key":"13_CR35","doi-asserted-by":"publisher","first-page":"1751","DOI":"10.14778\/3401960.3401971","volume":"13","author":"C Yulin","year":"2020","unstructured":"Yulin, C., Zhuohang, L., Shixuan, S., Yue, W., Qiong, L.: Accelerating truss decomposition on heterogeneous processors. Proc. VLDB Endow. 13(10), 1751\u20131764 (2020)","journal-title":"Proc. VLDB Endow."},{"key":"13_CR36","doi-asserted-by":"crossref","unstructured":"Zhang, J., Spampinato, D., McMillan, S., Franchetti, F.: Preliminary exploration of large-scale triangle counting on shared-memory multicore system. In: IEEE High Performance Extreme Computing Conference (2018)","DOI":"10.1109\/HPEC.2018.8547569"},{"key":"13_CR37","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Yu, J.X.: Unboundedness and efficiency of truss maintenance in evolving graphs. In: Proceedings of the 2019 International Conference on Management of Data, SIGMOD Conference 2019, Amsterdam, The Netherlands, 30 June\u20135 July, 2019, pp. 1024\u20131041. ACM (2019)","DOI":"10.1145\/3299869.3300082"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-95388-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T00:09:42Z","timestamp":1726704582000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-95388-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030953874","9783030953881"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-95388-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"23 February 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","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":"3 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/ica3pp2021\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"403","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":"145","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":"0","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":"36% - 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":"3.12","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":"2.27","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)"}}]}}