{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:17:38Z","timestamp":1750220258688,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T00:00:00Z","timestamp":1636329600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001804","name":"Canada Research Chairs","doi-asserted-by":"publisher","award":["950-231363"],"award-info":[{"award-number":["950-231363"]}],"id":[{"id":"10.13039\/501100001804","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NSERC Discovery Grants","award":["RGPIN-2017-04039, RGPIN-2017-04039, RGPIN-2016-04022, RGPIN-2021-03530"],"award-info":[{"award-number":["RGPIN-2017-04039, RGPIN-2017-04039, RGPIN-2016-04022, RGPIN-2021-03530"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,11,8]]},"DOI":"10.1145\/3487351.3489470","type":"proceedings-article","created":{"date-parts":[[2022,1,19]],"date-time":"2022-01-19T20:40:12Z","timestamp":1642624812000},"page":"532-539","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Multi-stage graph peeling algorithm for probabilistic core decomposition"],"prefix":"10.1145","author":[{"given":"Yang","family":"Guo","sequence":"first","affiliation":[{"name":"University of Victoria, Victoria, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuekui","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of Victoria, Victoria, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fatemeh","family":"Esfahani","sequence":"additional","affiliation":[{"name":"University of Victoria, Victoria, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesh","family":"Srinivasan","sequence":"additional","affiliation":[{"name":"University of Victoria, Victoria, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Thomo","sequence":"additional","affiliation":[{"name":"University of Victoria, Victoria, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Xing","sequence":"additional","affiliation":[{"name":"University of Saskatchewan, Saskatoon, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,1,19]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1316","volume-title":"Core decomposition of uncertain graphs,\" in Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining","author":"Bonchi F.","year":"2014","unstructured":"F. Bonchi , F. Gullo , A. Kaltenbrunner , and Y. Volkovich , \" Core decomposition of uncertain graphs,\" in Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining , 2014 , pp. 1316 -- 1325 . F. Bonchi, F. Gullo, A. Kaltenbrunner, and Y. Volkovich, \"Core decomposition of uncertain graphs,\" in Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining, 2014, pp. 1316--1325."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2008.10.032"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/MS.2009.16"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2164-11-S1-S3"},{"key":"e_1_3_2_1_5_1","first-page":"786","article-title":"The reachability query over distributed uncertain graphs","author":"Cheng Y.","year":"2015","unstructured":"Y. Cheng , Y. Yuan , L. Chen , and G. Wang , \" The reachability query over distributed uncertain graphs ,\" in ICDCS , 2015 , pp. 786 -- 787 . Y. Cheng, Y. Yuan, L. Chen, and G. Wang, \"The reachability query over distributed uncertain graphs,\" in ICDCS, 2015, pp. 786--787.","journal-title":"ICDCS"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-013-0122-z"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1039\/c0mb00058b"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1038\/msb4100129"},{"key":"e_1_3_2_1_9_1","first-page":"325","volume-title":"Efficient computation of probabilistic core decomposition at web-scale,\" in Proceedings of the 22nd International Conference on Extending Database Technology (EDBT)","author":"Esfahani F.","year":"2019","unstructured":"F. Esfahani , V. Srinivasan , A. Thomo , and K. Wu , \" Efficient computation of probabilistic core decomposition at web-scale,\" in Proceedings of the 22nd International Conference on Extending Database Technology (EDBT) , 2019 , pp. 325 -- 336 . F. Esfahani, V. Srinivasan, A. Thomo, and K. Wu, \"Efficient computation of probabilistic core decomposition at web-scale,\" in Proceedings of the 22nd International Conference on Extending Database Technology (EDBT), 2019, pp. 325--336."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511977770.003"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1093\/bib\/bbab455"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00587-4"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1116502109"},{"key":"e_1_3_2_1_14_1","first-page":"403","volume-title":"Listing all maximal cliques in sparse graphs in near-optimal time,\" in ISAAC","author":"Eppstein D.","year":"2010","unstructured":"D. Eppstein , M. L\u00f6ffler , and D. Strash , \" Listing all maximal cliques in sparse graphs in near-optimal time,\" in ISAAC . Springer , 2010 , pp. 403 -- 414 . D. Eppstein, M. L\u00f6ffler, and D. Strash, \"Listing all maximal cliques in sparse graphs in near-optimal time,\" in ISAAC. Springer, 2010, pp. 403--414."},{"key":"e_1_3_2_1_15_1","volume-title":"An o (m) algorithm for cores decomposition of networks,\" arXiv preprint cs\/0310049","author":"Batagelj V.","year":"2003","unstructured":"V. Batagelj and M. Zaversnik , \" An o (m) algorithm for cores decomposition of networks,\" arXiv preprint cs\/0310049 , 2003 . V. Batagelj and M. Zaversnik, \"An o (m) algorithm for cores decomposition of networks,\" arXiv preprint cs\/0310049, 2003."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2012.124"},{"key":"e_1_3_2_1_17_1","first-page":"133","article-title":"I\/o efficient core graph decomposition at web scale","author":"Wen D.","year":"2016","unstructured":"D. Wen , L. Qin , Y. Zhang , X. Lin , and J. Yu , \" I\/o efficient core graph decomposition at web scale ,\" in Proc. ICDE. IEEE , 2016 , pp. 133 -- 144 . D. Wen, L. Qin, Y. Zhang, X. Lin, and J. Yu, \"I\/o efficient core graph decomposition at web scale,\" in Proc. ICDE. IEEE, 2016, pp. 133--144.","journal-title":"Proc. ICDE. IEEE"},{"key":"e_1_3_2_1_18_1","first-page":"161","article-title":"Distributed k-core decomposition and maintenance in large dynamic graphs","author":"Aridhi S.","year":"2016","unstructured":"S. Aridhi , M. Brugnara , A. Montresor , and Y. Velegrakis , \" Distributed k-core decomposition and maintenance in large dynamic graphs ,\" in Proc. DEBS. ACM , 2016 , pp. 161 -- 168 . S. Aridhi, M. Brugnara, A. Montresor, and Y. Velegrakis, \"Distributed k-core decomposition and maintenance in large dynamic graphs,\" in Proc. DEBS. ACM, 2016, pp. 161--168.","journal-title":"Proc. DEBS. ACM"},{"key":"e_1_3_2_1_19_1","first-page":"1192","article-title":"Efficient probabilistic k-core computation on uncertain graphs","author":"Peng Y.","year":"2018","unstructured":"Y. Peng , Y. Zhang , W. Zhang , X. Lin , and L. Qin , \" Efficient probabilistic k-core computation on uncertain graphs ,\" in ICDE , 2018 , pp. 1192 -- 1203 . Y. Peng, Y. Zhang, W. Zhang, X. Lin, and L. Qin, \"Efficient probabilistic k-core computation on uncertain graphs,\" in ICDE, 2018, pp. 1192--1203.","journal-title":"ICDE"},{"key":"e_1_3_2_1_20_1","first-page":"64","article-title":"Index-based optimal algorithm for computing k-cores in large uncertain graphs","author":"Yang B.","year":"2019","unstructured":"B. Yang , D. Wen , L. Qin , Y. Zhang , L. Chang , and R. Li , \" Index-based optimal algorithm for computing k-cores in large uncertain graphs ,\" in ICDE , 2019 , pp. 64 -- 75 . B. Yang, D. Wen, L. Qin, Y. Zhang, L. Chang, and R. Li, \"Index-based optimal algorithm for computing k-cores in large uncertain graphs,\" in ICDE, 2019, pp. 64--75.","journal-title":"ICDE"},{"key":"e_1_3_2_1_21_1","first-page":"77","article-title":"Truss decomposition of probabilistic graphs: Semantics and algorithms","author":"Huang X.","year":"2016","unstructured":"X. Huang , W. Lu , and L. V. Lakshmanan , \" Truss decomposition of probabilistic graphs: Semantics and algorithms ,\" in SIGMOD , 2016 , pp. 77 -- 90 . X. Huang, W. Lu, and L. V. Lakshmanan, \"Truss decomposition of probabilistic graphs: Semantics and algorithms,\" in SIGMOD, 2016, pp. 77--90.","journal-title":"SIGMOD"},{"key":"e_1_3_2_1_22_1","first-page":"722","volume-title":"Fast truss decomposition in large-scale probabilistic graphs.\" in Proceedings of the 22nd International Conference on Extending Database Technology (EDBT)","author":"Esfahani F.","year":"2019","unstructured":"F. Esfahani , J. Wu , V. Srinivasan , A. Thomo , and K. Wu , \" Fast truss decomposition in large-scale probabilistic graphs.\" in Proceedings of the 22nd International Conference on Extending Database Technology (EDBT) , 2019 , pp. 722 -- 725 . F. Esfahani, J. Wu, V. Srinivasan, A. Thomo, and K. Wu, \"Fast truss decomposition in large-scale probabilistic graphs.\" in Proceedings of the 22nd International Conference on Extending Database Technology (EDBT), 2019, pp. 722--725."},{"key":"e_1_3_2_1_23_1","first-page":"1","article-title":"Nouvelle forme de la th\u00e9oreme dur la limite de probabilit\u00e9","volume":"12","author":"Lyapunov A.","year":"1901","unstructured":"A. Lyapunov , \" Nouvelle forme de la th\u00e9oreme dur la limite de probabilit\u00e9 ,\" M\u00e9moires de l'Academie Imp\u00e9riale des Sci. de St. Petersbourg , vol. 12 , pp. 1 -- 24 , 1901 . A. Lyapunov, \"Nouvelle forme de la th\u00e9oreme dur la limite de probabilit\u00e9,\" M\u00e9moires de l'Academie Imp\u00e9riale des Sci. de St. Petersbourg, vol. 12, pp. 1--24, 1901.","journal-title":"M\u00e9moires de l'Academie Imp\u00e9riale des Sci. de St. Petersbourg"},{"key":"e_1_3_2_1_24_1","first-page":"595","volume-title":"The WebGraph framework I: Compression techniques,\" in Proc. of the Thirteenth International World Wide Web Conference (WWW","author":"Boldi P.","year":"2004","unstructured":"P. Boldi and S. Vigna , \" The WebGraph framework I: Compression techniques,\" in Proc. of the Thirteenth International World Wide Web Conference (WWW 2004 ). Manhattan, USA : ACM Press , 2004, pp. 595 -- 601 . P. Boldi and S. Vigna, \"The WebGraph framework I: Compression techniques,\" in Proc. of the Thirteenth International World Wide Web Conference (WWW 2004). Manhattan, USA: ACM Press, 2004, pp. 595--601."},{"key":"e_1_3_2_1_25_1","first-page":"587","volume-title":"Layered label propagation: A multiresolution coordinate-free ordering for compressing social networks,\" in Proceedings of the 20th international conference on World Wide Web","author":"Boldi P.","year":"2011","unstructured":"P. Boldi , M. Rosa , M. Santini , and S. Vigna , \" Layered label propagation: A multiresolution coordinate-free ordering for compressing social networks,\" in Proceedings of the 20th international conference on World Wide Web , S. Srinivasan, K. Ramamritham, A. Kumar, M. P. Ravindra, E. Bertino, and R. Kumar, Eds. ACM Press, 2011 , pp. 587 -- 596 . P. Boldi, M. Rosa, M. Santini, and S. Vigna, \"Layered label propagation: A multiresolution coordinate-free ordering for compressing social networks,\" in Proceedings of the 20th international conference on World Wide Web, S. Srinivasan, K. Ramamritham, A. Kumar, M. P. Ravindra, E. Bertino, and R. Kumar, Eds. ACM Press, 2011, pp. 587--596."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-13-119"}],"event":{"name":"ASONAM '21: International Conference on Advances in Social Networks Analysis and Mining","sponsor":["SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","IEEE CS"],"location":"Virtual Event Netherlands","acronym":"ASONAM '21"},"container-title":["Proceedings of the 2021 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3487351.3489470","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3487351.3489470","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:30:49Z","timestamp":1750188649000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3487351.3489470"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,8]]},"references-count":26,"alternative-id":["10.1145\/3487351.3489470","10.1145\/3487351"],"URL":"https:\/\/doi.org\/10.1145\/3487351.3489470","relation":{},"subject":[],"published":{"date-parts":[[2021,11,8]]},"assertion":[{"value":"2022-01-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}