{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:19:19Z","timestamp":1750220359191,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T00:00:00Z","timestamp":1625529600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,6]]},"DOI":"10.1145\/3468791.3468817","type":"proceedings-article","created":{"date-parts":[[2021,8,12]],"date-time":"2021-08-12T01:03:56Z","timestamp":1628730236000},"page":"145-156","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Truss Decomposition on Large Probabilistic Networks using H-Index"],"prefix":"10.1145","author":[{"given":"Fatemeh","family":"Esfahani","sequence":"first","affiliation":[{"name":"University of Victoria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahsa","family":"Daneshmand","sequence":"additional","affiliation":[{"name":"University of Victoria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesh","family":"Srinivasan","sequence":"additional","affiliation":[{"name":"University of Victoria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Thomo","sequence":"additional","affiliation":[{"name":"University of Victoria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kui","family":"Wu","sequence":"additional","affiliation":[{"name":"University of Victoria"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,8,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963488"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"volume-title":"Proceedings of the 20th ACM SIGKDD international conference on Knowledge Discovery and Data Mining. 1316\u20131325","author":"Bonchi F.","key":"e_1_3_2_1_3_1","unstructured":"F. Bonchi , F. Gullo , A. Kaltenbrunner , and Y. Volkovich . 2014. Core decomposition of uncertain graphs . In Proceedings of the 20th ACM SIGKDD international conference on Knowledge Discovery and Data Mining. 1316\u20131325 . F. Bonchi, F. Gullo, A. Kaltenbrunner, and Y. Volkovich. 2014. Core decomposition of uncertain graphs. In Proceedings of the 20th ACM SIGKDD international conference on Knowledge Discovery and Data Mining. 1316\u20131325."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.14778\/3401960.3401971"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.2200\/S00465ED1V01Y201212DTM033"},{"volume-title":"2015 IEEE 35th International Conference on Distributed Computing Systems. 786\u2013787","author":"Cheng Y.","key":"e_1_3_2_1_6_1","unstructured":"Y. Cheng , Y. Yuan , L. Chen , and G. Wang . 2015. The reachability query over distributed uncertain graphs . In 2015 IEEE 35th International Conference on Distributed Computing Systems. 786\u2013787 . Y. Cheng, Y. Yuan, L. Chen, and G. Wang. 2015. The reachability query over distributed uncertain graphs. In 2015 IEEE 35th International Conference on Distributed Computing Systems. 786\u2013787."},{"key":"e_1_3_2_1_7_1","volume-title":"Proceedings of the 22nd International Conference on Extending Database Technology. 325\u2013336","author":"Esfahani Fatemeh","year":"2019","unstructured":"Fatemeh Esfahani , Venkatesh Srinivasan , Alex Thomo , and Kui Wu . 2019 . Efficient Computation of Probabilistic Core Decomposition at Web-Scale .. In Proceedings of the 22nd International Conference on Extending Database Technology. 325\u2013336 . Fatemeh Esfahani, Venkatesh Srinivasan, Alex Thomo, and Kui Wu. 2019. Efficient Computation of Probabilistic Core Decomposition at Web-Scale.. In Proceedings of the 22nd International Conference on Extending Database Technology. 325\u2013336."},{"volume-title":"Proceedings of the 22nd International Conference on Extending Database Technology. 722\u2013725","author":"Esfahani F.","key":"e_1_3_2_1_8_1","unstructured":"F. Esfahani , J. Wu , V. Srinivasan , A. Thomo , and K. Wu . 2019. Fast Truss Decomposition in Large-scale Probabilistic Graphs .. In Proceedings of the 22nd International Conference on Extending Database Technology. 722\u2013725 . F. Esfahani, J. Wu, V. Srinivasan, A. Thomo, and K. Wu. 2019. Fast Truss Decomposition in Large-scale Probabilistic Graphs.. In Proceedings of the 22nd International Conference on Extending Database Technology. 722\u2013725."},{"volume-title":"Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data. 1311\u20131322","author":"Huang X.","key":"e_1_3_2_1_9_1","unstructured":"X. Huang , H. Cheng , L. Qin , W. Tian , and J. Yu . 2014. Querying k-truss community in large and dynamic graphs . In Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data. 1311\u20131322 . X. Huang, H. Cheng, L. Qin, W. Tian, and J. Yu. 2014. Querying k-truss community in large and dynamic graphs. In Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data. 1311\u20131322."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882913"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/2002938.2002941"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2816653"},{"volume-title":"2015 IEEE 31st International Conference on Data Engineering. 243\u2013254","author":"Mukherjee P.","key":"e_1_3_2_1_13_1","unstructured":"A.\u00a0 P. Mukherjee , P. Xu , and S. Tirthapura . 2015. Mining maximal cliques from an uncertain graph . In 2015 IEEE 31st International Conference on Data Engineering. 243\u2013254 . A.\u00a0P. Mukherjee, P. Xu, and S. Tirthapura. 2015. Mining maximal cliques from an uncertain graph. In 2015 IEEE 31st International Conference on Data Engineering. 243\u2013254."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2593668"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2819651"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00110"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920967"},{"key":"e_1_3_2_1_18_1","unstructured":"A. Sar\u0131y\u00fcce C. Seshadhri and A. Pinar. 2019. Local Algorithms for Hierarchical Dense Subgraph Discovery. VLDB (2019).  A. Sar\u0131y\u00fcce C. Seshadhri and A. Pinar. 2019. Local Algorithms for Hierarchical Dense Subgraph Discovery. VLDB (2019)."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2017.8091049"},{"key":"e_1_3_2_1_20_1","first-page":"812","article-title":"Truss decomposition in massive networks","volume":"5","author":"Wang J.","year":"2012","unstructured":"J. Wang and J. Cheng . 2012 . Truss decomposition in massive networks . VLDB 5 , 9 (2012), 812 \u2013 823 . J. Wang and J. Cheng. 2012. Truss decomposition in massive networks. VLDB 5, 9 (2012), 812\u2013823.","journal-title":"VLDB"},{"volume-title":"Fast Truss Decomposition in Memory. In International Conference on Security, Privacy and Anonymity in Computation, Communication and Storage. 719\u2013729","author":"Xing Y.","key":"e_1_3_2_1_21_1","unstructured":"Y. Xing , N. Xiao , Y. Lu , R. Li , S. Yu , and S. Gao . 2017 . Fast Truss Decomposition in Memory. In International Conference on Security, Privacy and Anonymity in Computation, Communication and Storage. 719\u2013729 . Y. Xing, N. Xiao, Y. Lu, R. Li, S. Yu, and S. Gao. 2017. Fast Truss Decomposition in Memory. In International Conference on Security, Privacy and Anonymity in Computation, Communication and Storage. 719\u2013729."},{"volume-title":"International Conference on Database Systems for Advanced Applications. 155\u2013170","author":"Yuan Y.","key":"e_1_3_2_1_22_1","unstructured":"Y. Yuan , L. Chen , and G. Wang . 2010. Efficiently answering probability threshold-based shortest path queries over uncertain graphs . In International Conference on Database Systems for Advanced Applications. 155\u2013170 . Y. Yuan, L. Chen, and G. Wang. 2010. Efficiently answering probability threshold-based shortest path queries over uncertain graphs. In International Conference on Database Systems for Advanced Applications. 155\u2013170."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.222"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.14778\/3402707.3402726"},{"volume-title":"2012 IEEE International Conference on Data Engineering. IEEE, 1049\u20131060","author":"Zhang Y.","key":"e_1_3_2_1_25_1","unstructured":"Y. Zhang and S. Parthasarathy . 2012. Extracting analyzing and visualizing triangle k-core motifs within networks . In 2012 IEEE International Conference on Data Engineering. IEEE, 1049\u20131060 . Y. Zhang and S. Parthasarathy. 2012. Extracting analyzing and visualizing triangle k-core motifs within networks. In 2012 IEEE International Conference on Data Engineering. IEEE, 1049\u20131060."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.14778\/2535568.2448942"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835885"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2010.5447891"}],"event":{"name":"SSDBM 2021: 33rd International Conference on Scientific and Statistical Database Management","acronym":"SSDBM 2021","location":"Tampa FL USA"},"container-title":["33rd International Conference on Scientific and Statistical Database Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3468791.3468817","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3468791.3468817","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:21Z","timestamp":1750191441000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3468791.3468817"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,6]]},"references-count":28,"alternative-id":["10.1145\/3468791.3468817","10.1145\/3468791"],"URL":"https:\/\/doi.org\/10.1145\/3468791.3468817","relation":{},"subject":[],"published":{"date-parts":[[2021,7,6]]},"assertion":[{"value":"2021-08-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}