{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:27:12Z","timestamp":1763458032477,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,4,19]],"date-time":"2021-04-19T00:00:00Z","timestamp":1618790400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,4,19]]},"DOI":"10.1145\/3442381.3449976","type":"proceedings-article","created":{"date-parts":[[2021,6,3]],"date-time":"2021-06-03T19:37:45Z","timestamp":1622749065000},"page":"354-366","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Efficient Probabilistic Truss Indexing on Uncertain Graphs"],"prefix":"10.1145","author":[{"given":"Zitan","family":"Sun","sequence":"first","affiliation":[{"name":"HKBU, China"}]},{"given":"Xin","family":"Huang","sequence":"additional","affiliation":[{"name":"HKBU, China"}]},{"given":"Jianliang","family":"Xu","sequence":"additional","affiliation":[{"name":"HKBU, China"}]},{"given":"Francesco","family":"Bonchi","sequence":"additional","affiliation":[{"name":"ISI Foundation, Italy"}]}],"member":"320","published-online":{"date-parts":[[2021,6,3]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"[\n  1\n  ]  http:\/\/thebiogrid.org.  [1] http:\/\/thebiogrid.org."},{"key":"e_1_3_2_1_2_1","unstructured":"[\n  2\n  ]  http:\/\/dblp.uni-trier.de.  [2] http:\/\/dblp.uni-trier.de."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Suman Banerjee and Bithika Pal. 2020. DySky: Dynamic Skyline Queries on Uncertain Graphs. CoRR abs\/2004.02564(2020).  Suman Banerjee and Bithika Pal. 2020. DySky: Dynamic Skyline Queries on Uncertain Graphs. CoRR abs\/2004.02564(2020).","DOI":"10.1007\/978-3-030-62005-9_18"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"M. Blanco T.\u00a0M. Low and K. Kim. 2019. Exploration of fine-grained parallelism for load balancing eager k-truss on gpu and cpu. In HPEC. 1\u20137.  M. Blanco T.\u00a0M. Low and K. Kim. 2019. Exploration of fine-grained parallelism for load balancing eager k-truss on gpu and cpu. In HPEC. 1\u20137.","DOI":"10.1109\/HPEC.2019.8916473"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/944919.944937"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350254"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Francesco Bonchi Francesco Gullo Andreas Kaltenbrunner and Yana Volkovich. 2014. Core decomposition of uncertain graphs. In KDD. 1316\u20131325.  Francesco Bonchi Francesco Gullo Andreas Kaltenbrunner and Yana Volkovich. 2014. Core decomposition of uncertain graphs. In KDD. 1316\u20131325.","DOI":"10.1145\/2623330.2623655"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/3401960.3401971"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.2200\/S00465ED1V01Y201212DTM033"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2014.7004264"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/0214017"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Lauri E. and Hannu T.2012. Biomine: predicting links between biological entities using network models of heterogeneous databases. BMC Bioinformatics 13(2012).  Lauri E. and Hannu T.2012. Biomine: predicting links between biological entities using network models of heterogeneous databases. BMC Bioinformatics 13(2012).","DOI":"10.1186\/1471-2105-13-119"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Soroush Ebadian and Xin Huang. 2019. Fast algorithm for K-truss discovery on public-private graphs. In IJCAI. 2258\u20132264.  Soroush Ebadian and Xin Huang. 2019. Fast algorithm for K-truss discovery on public-private graphs. In IJCAI. 2258\u20132264.","DOI":"10.24963\/ijcai.2019\/313"},{"key":"e_1_3_2_1_14_1","unstructured":"Fatemeh Esfahani Jian Wu V. Srinivasan A. Thomo and K. Wu. 2019. Fast Truss Decomposition in Large-scale Probabilistic Graphs. In EDBT. 722\u2013725.  Fatemeh Esfahani Jian Wu V. Srinivasan A. Thomo and K. Wu. 2019. Fast Truss Decomposition in Large-scale Probabilistic Graphs. In EDBT. 722\u2013725."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Xin Huang Hong Cheng Lu Qin Wentao Tian and Jeffrey\u00a0Xu Yu. 2014. Querying k-truss community in large and dynamic graphs. In SIGMOD. 1311\u20131322.  Xin Huang Hong Cheng Lu Qin Wentao Tian and Jeffrey\u00a0Xu Yu. 2014. Querying k-truss community in large and dynamic graphs. In SIGMOD. 1311\u20131322.","DOI":"10.1145\/2588555.2610495"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/3099622.3099626"},{"key":"e_1_3_2_1_17_1","volume-title":"Approximate Closest Community Search in Networks. PVLDB 9, 4","author":"Huang Xin","year":"2015","unstructured":"Xin Huang , Laks\u00a0 VS Lakshmanan , Jeffrey\u00a0Xu Yu , and Hong Cheng . 2015. Approximate Closest Community Search in Networks. PVLDB 9, 4 ( 2015 ). Xin Huang, Laks\u00a0VS Lakshmanan, Jeffrey\u00a0Xu Yu, and Hong Cheng. 2015. Approximate Closest Community Search in Networks. PVLDB 9, 4 (2015)."},{"key":"e_1_3_2_1_18_1","volume-title":"\u00a0S. Lakshmanan","author":"Huang Xin","year":"2016","unstructured":"Xin Huang , Wei Lu , and Laks V . \u00a0S. Lakshmanan . 2016 . Truss Decomposition of Probabilistic Graphs: Semantics and Algorithms. In SIGMOD. 77\u201390. Xin Huang, Wei Lu, and Laks V.\u00a0S. Lakshmanan. 2016. Truss Decomposition of Probabilistic Graphs: Semantics and Algorithms. In SIGMOD. 77\u201390."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/2002938.2002941"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"H. Kabir and K. Madduri. 2017. Shared-Memory Graph Truss Decomposition. In HiPC. 13\u201322.  H. Kabir and K. Madduri. 2017. Shared-Memory Graph Truss Decomposition. In HiPC. 13\u201322.","DOI":"10.1109\/HiPC.2017.00012"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"V. Kassiano A. Gounaris A. Papadopoulos and K. Tsichlas. 2016. Mining uncertain graphs: An overview. In Algorithmic Aspects of Cloud Computing. 87\u2013116.  V. Kassiano A. Gounaris A. Papadopoulos and K. Tsichlas. 2016. Mining uncertain graphs: An overview. In Algorithmic Aspects of Cloud Computing. 87\u2013116.","DOI":"10.1007\/978-3-319-57045-7_6"},{"key":"e_1_3_2_1_22_1","unstructured":"Arijit Khan Francesco Bonchi Aristides Gionis and Francesco Gullo. 2014. Fast Reliability Search in Uncertain Graphs. In EDBT. 535\u2013546.  Arijit Khan Francesco Bonchi Aristides Gionis and Francesco Gullo. 2014. Fast Reliability Search in Uncertain Graphs. In EDBT. 535\u2013546."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2816653"},{"key":"e_1_3_2_1_24_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data.  Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Qing Liu Minjun Zhao Xin Huang Jianliang Xu and Yunjun Gao. 2020. Truss-based Community Search over Large Directed Graphs. In SIGMOD. 2183\u20132197.  Qing Liu Minjun Zhao Xin Huang Jianliang Xu and Yunjun Gao. 2020. Truss-based Community Search over Large Directed Graphs. In SIGMOD. 2183\u20132197.","DOI":"10.1145\/3318464.3380587"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00139635"},{"key":"e_1_3_2_1_27_1","unstructured":"Arko\u00a0Provo Mukherjee Pan Xu and Srikanta Tirthapura. 2013. Mining Maximal Cliques from an Uncertain Graph. arXiv preprint arXiv:1310.6780(2013).  Arko\u00a0Provo Mukherjee Pan Xu and Srikanta Tirthapura. 2013. Mining Maximal Cliques from an Uncertain Graph. arXiv preprint arXiv:1310.6780(2013)."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"P. Parchas F. Gullo D. Papadias and F. Bonchi. 2014. The pursuit of a good possible world: extracting representative instances of uncertain graphs. In SIGMOD. 967\u2013978.  P. Parchas F. Gullo D. Papadias and F. Bonchi. 2014. The pursuit of a good possible world: extracting representative instances of uncertain graphs. In SIGMOD. 967\u2013978.","DOI":"10.1145\/2588555.2593668"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2819651"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Jian Pei Daxin Jiang and Aidong Zhang. 2005. Mining Cross-Graph Quasi-Cliques in Gene Expression and Protein Interaction Data. In ICDE. 353\u2013354.  Jian Pei Daxin Jiang and Aidong Zhang. 2005. Mining Cross-Graph Quasi-Cliques in Gene Expression and Protein Interaction Data. In ICDE. 353\u2013354.","DOI":"10.1145\/1081870.1081898"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920967"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"G. Preti G.\u00a0De\u00a0Francisci Morales and F. Bonchi. 2021. STruD: Truss Decomposition of Simplicial Complexes. In WWW.  G. Preti G.\u00a0De\u00a0Francisci Morales and F. Bonchi. 2021. STruD: Truss Decomposition of Simplicial Complexes. In WWW.","DOI":"10.1145\/3442381.3450073"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536336.2536344"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1098\/rsos.160270"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Charalampos Tsourakakis. 2015. The k-clique densest subgraph problem. In WWW. 1122\u20131132.  Charalampos Tsourakakis. 2015. The k-clique densest subgraph problem. In WWW. 1122\u20131132.","DOI":"10.1145\/2736277.2741098"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.14778\/2311906.2311909"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"B. Yang D. Wen L. Qin Y. Zhang L. Chang and R. Li. 2019. Index-Based Optimal Algorithm for Computing K-Cores in Large Uncertain Graphs. In ICDE. 64\u201375.  B. Yang D. Wen L. Qin Y. Zhang L. Chang and R. Li. 2019. Index-Based Optimal Algorithm for Computing K-Cores in Large Uncertain Graphs. In ICDE. 64\u201375.","DOI":"10.1109\/ICDE.2019.00015"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.222"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.14778\/3402707.3402726"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"crossref","unstructured":"Yikai Zhang and Jeffrey\u00a0Xu Yu. 2019. Unboundedness and Efficiency of Truss Maintenance in Evolving Graphs. In SIGMOD. 1024\u20131041.  Yikai Zhang and Jeffrey\u00a0Xu Yu. 2019. Unboundedness and Efficiency of Truss Maintenance in Evolving Graphs. In SIGMOD. 1024\u20131041.","DOI":"10.1145\/3299869.3300082"},{"key":"e_1_3_2_1_41_1","unstructured":"Zhaonian Zou Jianzhong Li Hong Gao and Shuo Zhang. 2010. Finding top-k maximal cliques in an uncertain graph. In ICDE. 649\u2013652.  Zhaonian Zou Jianzhong Li Hong Gao and Shuo Zhang. 2010. Finding top-k maximal cliques in an uncertain graph. In ICDE. 649\u2013652."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-016-0943-y"}],"event":{"name":"WWW '21: The Web Conference 2021","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Ljubljana Slovenia","acronym":"WWW '21"},"container-title":["Proceedings of the Web Conference 2021"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3442381.3449976","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3442381.3449976","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:24:44Z","timestamp":1750195484000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3442381.3449976"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,19]]},"references-count":42,"alternative-id":["10.1145\/3442381.3449976","10.1145\/3442381"],"URL":"https:\/\/doi.org\/10.1145\/3442381.3449976","relation":{},"subject":[],"published":{"date-parts":[[2021,4,19]]},"assertion":[{"value":"2021-06-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}