{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:42:27Z","timestamp":1740109347626,"version":"3.37.3"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2024,9,2]],"date-time":"2024-09-02T00:00:00Z","timestamp":1725235200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,9,2]],"date-time":"2024-09-02T00:00:00Z","timestamp":1725235200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62372101"],"award-info":[{"award-number":["62372101"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s10115-024-02215-2","type":"journal-article","created":{"date-parts":[[2024,9,2]],"date-time":"2024-09-02T21:02:06Z","timestamp":1725310926000},"page":"7739-7773","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Truss community search in uncertain graphs"],"prefix":"10.1007","volume":"66","author":[{"given":"Bo","family":"Xing","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuting","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junfeng","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,9,2]]},"reference":[{"issue":"1\u20132","key":"2215_CR1","doi-asserted-by":"publisher","first-page":"997","DOI":"10.14778\/1920841.1920967","volume":"3","author":"M Potamias","year":"2010","unstructured":"Potamias M, Bonchi F, Gionis A, Kollios G (2010) K-nearest neighbors in uncertain graphs. Proc VLDB Endow 3(1\u20132):997\u20131008. https:\/\/doi.org\/10.14778\/1920841.1920967","journal-title":"Proc VLDB Endow"},{"doi-asserted-by":"publisher","unstructured":"Jin R, Liu L, Aggarwal CC (2011) Discovering highly reliable subgraphs in uncertain graphs. In: Proceedings of the 17th ACM SIGKDD international conference on knowledge discovery and data mining, pp 992\u20131000. https:\/\/doi.org\/10.1145\/2020408.2020569","key":"2215_CR2","DOI":"10.1145\/2020408.2020569"},{"doi-asserted-by":"publisher","unstructured":"Huang X, Cheng H, Qin L, Tian W, Yu JX (2014) Querying k-truss community in large and dynamic graphs. In: Proceedings of the 2014 ACM SIGMOD international conference on management of data. ACM, pp 1311\u20131322. https:\/\/doi.org\/10.1145\/2588555.2610495","key":"2215_CR3","DOI":"10.1145\/2588555.2610495"},{"doi-asserted-by":"publisher","unstructured":"Sozio M, Gionis A (2010) The community-search problem and how to plan a successful cocktail party. In: Proceedings of the 16th ACM SIGKDD international conference on knowledge discovery and data mining, pp 939\u2013948. https:\/\/doi.org\/10.1145\/1835804.1835923","key":"2215_CR4","DOI":"10.1145\/1835804.1835923"},{"issue":"6","key":"2215_CR5","doi-asserted-by":"publisher","first-page":"709","DOI":"10.14778\/3055330.3055337","volume":"10","author":"Y Fang","year":"2017","unstructured":"Fang Y, Cheng R, Li X, Luo S, Hu J (2017) Effective community search over large spatial graphs. Proc VLDB Endow 10(6):709\u2013720. https:\/\/doi.org\/10.14778\/3055330.3055337","journal-title":"Proc VLDB Endow"},{"issue":"4","key":"2215_CR6","doi-asserted-by":"publisher","first-page":"276","DOI":"10.14778\/2856318.2856323","volume":"9","author":"X Huang","year":"2015","unstructured":"Huang X, Lakshmanan LVS, Yu JX, Cheng H (2015) Approximate closest community search in networks. Proc VLDB Endow 9(4):276\u2013287. https:\/\/doi.org\/10.14778\/2856318.2856323","journal-title":"Proc VLDB Endow"},{"issue":"7084","key":"2215_CR7","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1038\/nature04670","volume":"440","author":"NJ Krogan","year":"2006","unstructured":"Krogan NJ, Cagney G, Yu H, Zhong G, Guo X, Ignatchenko A, Li J, Pu S, Datta N, Tikuisis AP et al (2006) Global landscape of protein complexes in the yeast saccharomyces cerevisiae. Nature 440(7084):637\u2013643","journal-title":"Nature"},{"issue":"1","key":"2215_CR8","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1038\/msb4100129","volume":"3","author":"R Sharan","year":"2007","unstructured":"Sharan R, Ulitsky I, Shamir R (2007) Network-based prediction of protein function. Mol Syst Biol 3(1):88","journal-title":"Mol Syst Biol"},{"issue":"5","key":"2215_CR9","doi-asserted-by":"publisher","first-page":"509","DOI":"10.14778\/2735479.2735484","volume":"8","author":"R-H Li","year":"2015","unstructured":"Li R-H, Qin L, Yu JX, Mao R (2015) Influential community search in large networks. Proc VLDB Endow 8(5):509\u2013520. https:\/\/doi.org\/10.14778\/2735479.2735484","journal-title":"Proc VLDB Endow"},{"doi-asserted-by":"publisher","unstructured":"Bonchi F, Gullo F, Kaltenbrunner A, Volkovich Y (2014) Core decomposition of uncertain graphs. In: Proceedings of the 20th ACM SIGKDD international conference on knowledge discovery and data mining, pp 1316\u20131325. https:\/\/doi.org\/10.1145\/2623330.2623655","key":"2215_CR10","DOI":"10.1145\/2623330.2623655"},{"doi-asserted-by":"publisher","unstructured":"Yang B, Wen D, Qin L, Zhang Y, Chang L, Li R-H (2019) Index-based optimal algorithm for computing k-cores in large uncertain graphs. In: 2019 IEEE 35th international conference on data engineering (ICDE). IEEE, pp 64\u201375. https:\/\/doi.org\/10.1109\/ICDE.2019.00015","key":"2215_CR11","DOI":"10.1109\/ICDE.2019.00015"},{"issue":"1","key":"2215_CR12","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1109\/TKDE.2021.3088504","volume":"35","author":"Q Dai","year":"2021","unstructured":"Dai Q, Li R-H, Wang G, Mao R, Zhang Z, Yuan Y (2021) Core decomposition on uncertain graphs revisited. IEEE Trans Knowl Data Eng 35(1):196\u2013210. https:\/\/doi.org\/10.1109\/TKDE.2021.3088504","journal-title":"IEEE Trans Knowl Data Eng"},{"doi-asserted-by":"publisher","unstructured":"Huang X, Lu W, Lakshmanan LVS (2016) Truss decomposition of probabilistic graphs: semantics and algorithms. In: \u00d6zcan F, Koutrika G, Madden S (eds) Proceedings of the 2016 international conference on management of data, SIGMOD conference 2016, San Francisco, CA, USA, June 26\u2013July 01, 2016. ACM, pp 77\u201390. https:\/\/doi.org\/10.1145\/2882903.2882913","key":"2215_CR13","DOI":"10.1145\/2882903.2882913"},{"key":"2215_CR14","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/S10115-016-0943-Y","volume":"50","author":"Z Zou","year":"2017","unstructured":"Zou Z, Zhu R (2017) Truss decomposition of uncertain graphs. Knowl Inf Syst 50:197\u2013230. https:\/\/doi.org\/10.1007\/S10115-016-0943-Y","journal-title":"Knowl Inf Syst"},{"doi-asserted-by":"publisher","unstructured":"Esfahani F, Wu J, Srinivasan V, Thomo A, Wu K (2019) Fast truss decomposition in large-scale probabilistic graphs. In: Advances in database technology\u201422nd international conference on extending database technology, EDBT 2019, Lisbon, Portugal, March 26-29, 2019. OpenProceedings.org, pp 722\u2013725. https:\/\/doi.org\/10.5441\/002\/EDBT.2019.96","key":"2215_CR15","DOI":"10.5441\/002\/EDBT.2019.96"},{"doi-asserted-by":"publisher","unstructured":"Esfahani F, Daneshmand M, Srinivasan V, Thomo A, Wu K (2021) Truss decomposition on large probabilistic networks using h-index. In: Zhu Q, Zhu X, Tu Y, Xu Z, Kumar A (eds) SSDBM 2021: 33rd international conference on scientific and statistical database management, Tampa, FL, USA, July 6\u20137, 2021. ACM, pp 145\u2013156. https:\/\/doi.org\/10.1145\/3468791.3468817","key":"2215_CR16","DOI":"10.1145\/3468791.3468817"},{"doi-asserted-by":"publisher","unstructured":"Sun Z, Huang X, Xu J, Bonchi F (2021) Efficient probabilistic truss indexing on uncertain graphs. In: WWW \u201921: Proceedings of the web conference 2021, pp 354\u2013366. https:\/\/doi.org\/10.1145\/3442381.3449976","key":"2215_CR17","DOI":"10.1145\/3442381.3449976"},{"issue":"11","key":"2215_CR18","doi-asserted-by":"publisher","first-page":"876","DOI":"10.14778\/3402707.3402726","volume":"4","author":"Y Yuan","year":"2011","unstructured":"Yuan Y, Wang G, Wang H, Chen L (2011) Efficient subgraph search over large uncertain graphs. Proc VLDB Endow 4(11):876\u2013886","journal-title":"Proc VLDB Endow"},{"doi-asserted-by":"crossref","unstructured":"Wang J, Cheng J (2012) Truss decomposition in massive networks. arXiv preprint arXiv:1205.6693","key":"2215_CR19","DOI":"10.14778\/2311906.2311909"},{"doi-asserted-by":"publisher","unstructured":"Kabir H, Madduri K (2017) Shared-memory graph truss decomposition. In: 2017 IEEE 24th international conference on high performance computing (HiPC), pp 13\u201322. https:\/\/doi.org\/10.1109\/HIPC.2017.00012 . IEEE","key":"2215_CR20","DOI":"10.1109\/HIPC.2017.00012"},{"key":"2215_CR21","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1007\/S00778-020-00649-Y","volume":"30","author":"Y Jiang","year":"2021","unstructured":"Jiang Y, Huang X, Cheng H (2021) I\/o efficient k-truss community search in massive graphs. VLDB J 30:713\u2013738. https:\/\/doi.org\/10.1007\/S00778-020-00649-Y","journal-title":"VLDB J"},{"issue":"11","key":"2215_CR22","doi-asserted-by":"publisher","first-page":"1298","DOI":"10.14778\/3137628.3137640","volume":"10","author":"E Akbas","year":"2017","unstructured":"Akbas E, Zhao P (2017) Truss-based community search: a truss-equivalence based indexing approach. Proc VLDB Endow 10(11):1298\u20131309. https:\/\/doi.org\/10.14778\/3137628.3137640","journal-title":"Proc VLDB Endow"},{"issue":"3","key":"2215_CR23","doi-asserted-by":"publisher","first-page":"519","DOI":"10.14778\/3570690.3570701","volume":"16","author":"T Xu","year":"2022","unstructured":"Xu T, Lu Z, Zhu Y (2022) Efficient triangle-connected truss community search in dynamic graphs. Proc VLDB Endow 16(3):519\u2013531. https:\/\/doi.org\/10.14778\/3570690.3570701","journal-title":"Proc VLDB Endow"},{"issue":"9","key":"2215_CR24","doi-asserted-by":"publisher","first-page":"949","DOI":"10.14778\/3099622.3099626","volume":"10","author":"X Huang","year":"2017","unstructured":"Huang X, Lakshmanan LV (2017) Attribute-driven community search. Proc VLDB Endow 10(9):949\u2013960. https:\/\/doi.org\/10.14778\/3099622.3099626","journal-title":"Proc VLDB Endow"},{"doi-asserted-by":"publisher","unstructured":"Liu B, Zhang F, Zhang W, Lin X, Zhang Y (2021) Efficient community search with size constraint. In: 2021 IEEE 37th international conference on data engineering (ICDE). IEEE, pp 97\u2013108. https:\/\/doi.org\/10.1109\/ICDE51399.2021.00016","key":"2215_CR25","DOI":"10.1109\/ICDE51399.2021.00016"},{"issue":"9","key":"2215_CR26","doi-asserted-by":"publisher","first-page":"2199","DOI":"10.14778\/3598581.3598592","volume":"16","author":"A Tian","year":"2023","unstructured":"Tian A, Zhou A, Wang Y, Chen L (2023) Maximal d-truss search in dynamic directed graphs. Proc VLDB Endow 16(9):2199\u20132211. https:\/\/doi.org\/10.14778\/3598581.3598592","journal-title":"Proc VLDB Endow"},{"doi-asserted-by":"publisher","unstructured":"Liu Q, Zhao M, Huang X, Xu J, Gao Y (2020) Truss-based community search over large directed graphs. In: Maier D, Pottinger R, Doan A, Tan W, Alawini A, Ngo HQ (eds) Proceedings of the 2020 international conference on management of data, SIGMOD conference 2020, June 14\u201319, 2020. Online Conference [Portland, OR, USA]. ACM, pp 2183\u20132197. https:\/\/doi.org\/10.1145\/3318464.3380587","key":"2215_CR27","DOI":"10.1145\/3318464.3380587"},{"doi-asserted-by":"publisher","unstructured":"Sun R, Wu Y, Wang X (2022) Diversified top-r community search in geo-social network: a k-truss based model. In: Proceedings of the 25th international conference on extending database technology, EDBT 2022, March 29\u2013April 1, 2022. OpenProceedings.org, Edinburgh, UK, pp 2-4452448. https:\/\/doi.org\/10.48786\/EDBT.2022.38","key":"2215_CR28","DOI":"10.48786\/EDBT.2022.38"},{"key":"2215_CR29","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2024.3389049","author":"K Berahmand","year":"2024","unstructured":"Berahmand K, Bahadori S, Abadeh MN, Li Y, Xu Y (2024) Sdac-da: semi-supervised deep attributed clustering using dual autoencoder. IEEE Trans Knowl Data Eng. https:\/\/doi.org\/10.1109\/TKDE.2024.3389049","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2215_CR30","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1016\/J.INS.2022.11.101","volume":"621","author":"Y Peng","year":"2023","unstructured":"Peng Y, Zhao Y, Hu J (2023) On the role of community structure in evolution of opinion formation: a new bounded confidence opinion dynamics. Inf Sci 621:672\u2013690. https:\/\/doi.org\/10.1016\/J.INS.2022.11.101","journal-title":"Inf Sci"},{"key":"2215_CR31","doi-asserted-by":"publisher","first-page":"2729","DOI":"10.32604\/cmes.2023.046692","volume":"139","author":"W Zheng","year":"2024","unstructured":"Zheng W, Lu S, Cai Z, Wang R, Wang L, Yin L (2024) Pal-bert: an improved question answering model. Comput Model Eng Sci 139:2729\u20132745. https:\/\/doi.org\/10.32604\/cmes.2023.046692","journal-title":"Comput Model Eng Sci"},{"issue":"6","key":"2215_CR32","doi-asserted-by":"publisher","first-page":"1243","DOI":"10.14778\/3514061.3514070","volume":"15","author":"Y Jiang","year":"2022","unstructured":"Jiang Y, Rong Y, Cheng H, Huang X, Zhao K, Huang J (2022) Query driven-graph neural networks for community search: from non-attributed, attributed, to interactive attributed. Proc VLDB Endow 15(6):1243\u20131255. https:\/\/doi.org\/10.14778\/3514061.3514070","journal-title":"Proc VLDB Endow"},{"issue":"9","key":"2215_CR33","doi-asserted-by":"publisher","first-page":"812","DOI":"10.14778\/2311906.2311909","volume":"5","author":"J Wang","year":"2012","unstructured":"Wang J, Cheng J (2012) Truss decomposition in massive networks. Proc VLDB Endow 5(9):812\u2013823","journal-title":"Proc VLDB Endow"},{"issue":"1","key":"2215_CR34","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/S00500-021-06468-9","volume":"26","author":"M Rezvani","year":"2022","unstructured":"Rezvani M, Rezvani M (2022) Truss decomposition using triangle graphs. Soft Comput 26(1):55\u201368. https:\/\/doi.org\/10.1007\/S00500-021-06468-9","journal-title":"Soft Comput"},{"doi-asserted-by":"publisher","unstructured":"Tang J, Liu L, Jia J, Wu L, Wang X, Huang J (2022) A two-stage algorithm based on prediction and search for maxk-truss decomposition. In: 28th IEEE international conference on parallel and distributed systems, ICPADS 2022, January 10\u201312, 2023. IEEE, Nanjing, pp 491\u2013498. https:\/\/doi.org\/10.1109\/ICPADS56603.2022.00070","key":"2215_CR35","DOI":"10.1109\/ICPADS56603.2022.00070"},{"issue":"4","key":"2215_CR36","doi-asserted-by":"publisher","first-page":"3966","DOI":"10.1109\/TKDE.2021.3137955","volume":"35","author":"Z Chen","year":"2023","unstructured":"Chen Z, Yuan L, Han L, Qian Z (2023) Higher-order truss decomposition in graphs. IEEE Trans Knowl Data Eng 35(4):3966\u20133978. https:\/\/doi.org\/10.1109\/TKDE.2021.3137955","journal-title":"IEEE Trans Knowl Data Eng"},{"doi-asserted-by":"publisher","unstructured":"Chen P, Chou C, Chen M (2014) Distributed algorithms for k-truss decomposition. In: 2014 IEEE international conference on big data (IEEE BigData 2014), October 27\u201330, 2014. IEEE Computer Society, Washington, DC, USA, pp 471\u2013480. https:\/\/doi.org\/10.1109\/BIGDATA.2014.7004264","key":"2215_CR37","DOI":"10.1109\/BIGDATA.2014.7004264"},{"doi-asserted-by":"publisher","unstructured":"Chakaravarthy VT, Goyal A, Murali P, Pandian SS, Sabharwal Y (2018) Improved distributed algorithm for graph truss decomposition. In: Euro-Par 2018: parallel processing - 24th international conference on parallel and distributed computing, August 27\u201331, 2018, proceedings. Lecture notes in computer science, vol 11014. Springer, Turin, Italy, pp 703\u2013717. https:\/\/doi.org\/10.1007\/978-3-319-96983-1_50","key":"2215_CR38","DOI":"10.1007\/978-3-319-96983-1_50"},{"issue":"6","key":"2215_CR39","doi-asserted-by":"publisher","first-page":"1435","DOI":"10.1109\/TCSS.2020.3026574","volume":"7","author":"Q Luo","year":"2020","unstructured":"Luo Q, Yu D, Cheng X, Cai Z, Yu J, Lv W (2020) Batch processing for truss maintenance in large dynamic graphs. IEEE Trans Comput Soc Syst 7(6):1435\u20131446. https:\/\/doi.org\/10.1109\/TCSS.2020.3026574","journal-title":"IEEE Trans Comput Soc Syst"},{"doi-asserted-by":"publisher","unstructured":"Smith S, Liu X, Ahmed NK, Tom AS, Petrini F, Karypis G (2017) Truss decomposition on shared-memory parallel systems. In: 2017 IEEE high performance extreme computing conference, HPEC 2017, September 12\u201314, 2017. IEEE, Waltham, MA, USA, pp 1\u20136. https:\/\/doi.org\/10.1109\/HPEC.2017.8091049","key":"2215_CR40","DOI":"10.1109\/HPEC.2017.8091049"},{"doi-asserted-by":"publisher","unstructured":"Kabir H, Madduri K (2017) Shared-memory graph truss decomposition. In: 24th IEEE international conference on high performance computing, HiPC 2017, December 18\u201321, 2017. IEEE Computer Society, Jaipur, India, pp 13\u201322. https:\/\/doi.org\/10.1109\/HIPC.2017.00012","key":"2215_CR41","DOI":"10.1109\/HIPC.2017.00012"},{"doi-asserted-by":"crossref","unstructured":"Kabir H, Madduri K (2017) Parallel k-truss decomposition on multicore systems. In: 2017 IEEE high performance extreme computing conference, HPEC 2017, September 12\u201314, 2017. IEEE, Waltham, MA, USA, pp 1\u20137","key":"2215_CR42","DOI":"10.1109\/HPEC.2017.8091052"},{"doi-asserted-by":"publisher","unstructured":"Xing Y, Xiao N, Lu Y, Li R, Yu S, Gao S (2017) Fast truss decomposition in memory. In: Security, privacy, and anonymity in computation, communication, and storage-SpaCCS 2017 international workshops, December 12\u201315, 2017, proceedings. Lecture notes in computer science, vol 10658. Springer, Waltham, MA, USA, pp 719\u2013729. https:\/\/doi.org\/10.1007\/978-3-319-72395-2_64","key":"2215_CR43","DOI":"10.1007\/978-3-319-72395-2_64"},{"unstructured":"Sariy\u00fcce AE, Seshadhri C, Pinar A (2017) Parallel local algorithms for core, truss, and nucleus decompositions. CoRR arXiv:1704.00386","key":"2215_CR44"},{"doi-asserted-by":"publisher","unstructured":"Wu J, Goshulak A, Srinivasan V, Thomo A (2018) 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, August 28\u201331, 2018. IEEE Computer Society, Barcelona, Spain, pp 873\u2013880. https:\/\/doi.org\/10.1109\/ASONAM.2018.8508642","key":"2215_CR45","DOI":"10.1109\/ASONAM.2018.8508642"},{"doi-asserted-by":"publisher","unstructured":"Mailthody VS, Date K, Qureshi Z, Pearson C, Nagi R, Xiong J, Hwu W (2018) Collaborative (CPU + GPU) algorithms for triangle counting and truss decomposition. In: 2018 IEEE high performance extreme computing conference, HPEC 2018, September 25\u201327, 2018. IEEE, Waltham, MA, USA, pp 1\u20137. https:\/\/doi.org\/10.1109\/HPEC.2018.8547517","key":"2215_CR46","DOI":"10.1109\/HPEC.2018.8547517"},{"issue":"10","key":"2215_CR47","doi-asserted-by":"publisher","first-page":"1751","DOI":"10.14778\/3401960.3401971","volume":"13","author":"Y Che","year":"2020","unstructured":"Che Y, Lai Z, Sun S, Wang Y, Luo Q (2020) Accelerating truss decomposition on heterogeneous processors. Proc VLDB Endow 13(10):1751\u20131764. https:\/\/doi.org\/10.14778\/3401960.3401971","journal-title":"Proc VLDB Endow"},{"doi-asserted-by":"publisher","unstructured":"Almasri M, Anjum O, Pearson C, Qureshi Z, Mailthody VS, Nagi R, Xiong J, Hwu WW (2019) Update on k-truss decomposition on GPU. In: 2019 IEEE high performance extreme computing conference, HPEC 2019, September 24\u201326, 2019. IEEE, Waltham, MA, USA, pp 1\u20137. https:\/\/doi.org\/10.1109\/HPEC.2019.8916285","key":"2215_CR48","DOI":"10.1109\/HPEC.2019.8916285"},{"doi-asserted-by":"publisher","unstructured":"Huang S, El-Hadedy M, Hao C, Li Q, Mailthody VS, Date K, Xiong J, Chen D, Nagi R, Hwu W (2018) Triangle counting and truss decomposition using FPGA. In: 2018 IEEE high performance extreme computing conference, HPEC 2018, September 25\u201327, 2018. IEEE, Waltham, MA, USA, pp 1\u20137. https:\/\/doi.org\/10.1109\/HPEC.2018.8547536","key":"2215_CR49","DOI":"10.1109\/HPEC.2018.8547536"},{"doi-asserted-by":"publisher","unstructured":"Miao X, Liu Y, Chen L, Gao Y, Yin J (2022) Reliable community search on uncertain graphs. In: 2022 IEEE 38th international conference on data engineering (ICDE). IEEE, pp 1166\u20131179. https:\/\/doi.org\/10.1109\/ICDE53745.2022.00092","key":"2215_CR50","DOI":"10.1109\/ICDE53745.2022.00092"},{"issue":"11","key":"2215_CR51","doi-asserted-by":"publisher","first-page":"11165","DOI":"10.1109\/TKDE.2023.3234567","volume":"35","author":"K Wang","year":"2023","unstructured":"Wang K, Zhao G, Zhang W, Lin X, Zhang Y, He Y, Li C (2023) Cohesive subgraph discovery over uncertain bipartite graphs. IEEE Trans Knowl Data Eng 35(11):11165\u201311179. https:\/\/doi.org\/10.1109\/TKDE.2023.3234567","journal-title":"IEEE Trans Knowl Data Eng"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-024-02215-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-024-02215-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-024-02215-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,24]],"date-time":"2024-10-24T12:09:02Z","timestamp":1729771742000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-024-02215-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,2]]},"references-count":51,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["2215"],"URL":"https:\/\/doi.org\/10.1007\/s10115-024-02215-2","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2024,9,2]]},"assertion":[{"value":"21 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 August 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 August 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 September 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}