{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T19:48:41Z","timestamp":1780602521994,"version":"3.54.1"},"reference-count":143,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T00:00:00Z","timestamp":1656374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T00:00:00Z","timestamp":1656374400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"iit jammu, india."}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s10115-022-01681-w","type":"journal-article","created":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T06:03:53Z","timestamp":1656396233000},"page":"1653-1689","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["A survey on mining and analysis of uncertain graphs"],"prefix":"10.1007","volume":"64","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1761-5944","authenticated-orcid":false,"given":"Suman","family":"Banerjee","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,6,28]]},"reference":[{"issue":"2","key":"1681_CR1","first-page":"15","volume":"30","author":"E Adar","year":"2007","unstructured":"Adar E, Re C (2007) Managing uncertainty in social networks. IEEE Data Eng Bull 30(2):15\u201322","journal-title":"IEEE Data Eng Bull"},{"key":"1681_CR2","doi-asserted-by":"crossref","unstructured":"Aggarwal CC (2010) Managing and mining uncertain data, vol\u00a035. Springer Science & Business Media","DOI":"10.1007\/978-0-387-09690-2"},{"key":"1681_CR3","doi-asserted-by":"crossref","unstructured":"Aggarwal CC, Wang H (2010) A survey of clustering algorithms for graph data. In: Managing and mining graph data, Springer, pp 275\u2013301","DOI":"10.1007\/978-1-4419-6045-0_9"},{"key":"1681_CR4","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.ins.2015.10.036","volume":"331","author":"NM Ahmed","year":"2016","unstructured":"Ahmed NM, Chen L (2016) An efficient algorithm for link prediction in temporal uncertain social networks. Information Sciences 331:120\u2013136","journal-title":"Information Sciences"},{"key":"1681_CR5","doi-asserted-by":"crossref","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1988) Network flows","DOI":"10.21236\/ADA594171"},{"issue":"5","key":"1681_CR6","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/1411509.1411513","volume":"55","author":"N Ailon","year":"2008","unstructured":"Ailon N, Charikar M, Newman A (2008) Aggregating inconsistent information: ranking and clustering. Journal of the ACM (JACM) 55(5):23","journal-title":"Journal of the ACM (JACM)"},{"key":"1681_CR7","doi-asserted-by":"crossref","unstructured":"Alber J, Niedermeier R (2002) Improved tree decomposition based algorithms for domination-like problems. In: Latin American Symposium on Theoretical Informatics, Springer, pp 613\u2013627","DOI":"10.1007\/3-540-45995-2_52"},{"issue":"1","key":"1681_CR8","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF02189308","volume":"9","author":"I Alth\u00f6fer","year":"1993","unstructured":"Alth\u00f6fer I, Das G, Dobkin D, Joseph D, Soares J (1993) On sparse spanners of weighted graphs. Discrete & Computational Geometry 9(1):81\u2013100","journal-title":"Discrete & Computational Geometry"},{"issue":"3","key":"1681_CR9","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1109\/TR.1986.4335422","volume":"35","author":"MO Ball","year":"1986","unstructured":"Ball MO (1986) Computational complexity of network reliability analysis: An overview. IEEE Transactions on Reliability 35(3):230\u2013239","journal-title":"IEEE Transactions on Reliability"},{"key":"1681_CR10","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1016\/S0927-0507(05)80128-8","volume":"7","author":"MO Ball","year":"1995","unstructured":"Ball MO, Colbourn CJ, Provan JS (1995) Network reliability. Handbooks in operations research and management science 7:673\u2013762","journal-title":"Handbooks in operations research and management science"},{"key":"1681_CR11","doi-asserted-by":"crossref","unstructured":"Bell MG, Iida Y (1997) Transportation network analysis","DOI":"10.1002\/9781118903032"},{"key":"1681_CR12","unstructured":"Besta M, Stanojevic D, Licht JDF, Ben-Nun T, Hoefler T (2019) Graph processing on fpgas: Taxonomy, survey, challenges. arXiv preprint arXiv:1903.06697"},{"key":"1681_CR13","doi-asserted-by":"crossref","unstructured":"Bhagat S, Cormode G, Muthukrishnan S (2011) Node classification in social networks. In: Social network data analytics, Springer, pp 115\u2013148","DOI":"10.1007\/978-1-4419-8462-3_5"},{"key":"1681_CR14","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s B, B\u00e9la B (2001) Random graphs. 73, Cambridge university press","DOI":"10.1017\/CBO9780511814068"},{"key":"1681_CR15","doi-asserted-by":"crossref","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","DOI":"10.1145\/2623330.2623655"},{"issue":"3","key":"1681_CR16","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0166-218X(88)90065-0","volume":"21","author":"TB Brecht","year":"1988","unstructured":"Brecht TB, Colbourn CJ (1988) Lower bounds on two-terminal network reliability. Discrete applied mathematics 21(3):185\u2013198","journal-title":"Discrete applied mathematics"},{"issue":"1","key":"1681_CR17","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1186\/1471-2105-7-488","volume":"7","author":"S Brohee","year":"2006","unstructured":"Brohee S, Van Helden J (2006) Evaluation of clustering algorithms for protein-protein interaction networks. BMC bioinformatics 7(1):488","journal-title":"BMC bioinformatics"},{"key":"1681_CR18","doi-asserted-by":"crossref","unstructured":"Carrington PJ, Scott J, Wasserman S (2005) Models and methods in social network analysis, vol 28. Cambridge University Press","DOI":"10.1017\/CBO9780511811395"},{"key":"1681_CR19","doi-asserted-by":"crossref","unstructured":"Ceccarello M, Fantozzi C, Pietracaprina A, Pucci G, Vandin F (2017a) Clustering uncertain graphs. Proceedings of the VLDB Endowment 11(4):472\u2013484","DOI":"10.1145\/3186728.3164143"},{"key":"1681_CR20","doi-asserted-by":"publisher","unstructured":"Ceccarello M, Fantozzi C, Pietracaprina A, Pucci G, Vandin F (2017b) Clustering uncertain graphs. PVLDB 11(4):472\u2013484. https:\/\/doi.org\/10.1145\/3186728.3164143 (http:\/\/www.vldb.org\/pvldb\/vol11\/p472-ceccarello.pdf)","DOI":"10.1145\/3186728.3164143"},{"issue":"8","key":"1681_CR21","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1109\/TKDE.2010.67","volume":"22","author":"L Chen","year":"2010","unstructured":"Chen L, Wang C (2010) Continuous subgraph pattern search over certain and uncertain graph streams. IEEE Transactions on Knowledge and Data Engineering 22(8):1093\u20131109","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"1681_CR22","doi-asserted-by":"crossref","unstructured":"Chen Q, Fang C, Wang Z, Suo B, Li Z, Ives ZG (2016a) Parallelizing maximal clique enumeration over graph data. In: International Conference on Database Systems for Advanced Applications, Springer, pp 249\u2013264","DOI":"10.1007\/978-3-319-32049-6_16"},{"issue":"4","key":"1681_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-031-01850-3","volume":"5","author":"W Chen","year":"2013","unstructured":"Chen W, Lakshmanan LV, Castillo C (2013) Information and influence propagation in social networks. Synthesis Lectures on Data Management 5(4):1\u2013177","journal-title":"Synthesis Lectures on Data Management"},{"issue":"1","key":"1681_CR24","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1186\/s40649-016-0033-z","volume":"3","author":"W Chen","year":"2016","unstructured":"Chen W, Lin T, Yang C (2016b) Real-time topic-aware influence maximization using preprocessing. Computational social networks 3(1):8","journal-title":"Computational social networks"},{"key":"1681_CR25","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1016\/j.knosys.2018.10.002","volume":"163","author":"X Chen","year":"2019","unstructured":"Chen X, Huo H, Huan J, Vitter JS (2019) An efficient algorithm for graph edit distance computation. Knowledge-Based Systems 163:762\u2013775","journal-title":"Knowledge-Based Systems"},{"issue":"3","key":"1681_CR26","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s00778-021-00654-9","volume":"30","author":"X Chen","year":"2021","unstructured":"Chen X, Lai L, Qin L, Lin X (2021) Efficient structural node similarity computation on billion-scale graphs. The VLDB Journal 30(3):471\u2013493","journal-title":"The VLDB Journal"},{"issue":"2","key":"1681_CR27","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1109\/TKDE.2018.2830336","volume":"31","author":"Y Chen","year":"2018","unstructured":"Chen Y, Zhao X, Lin X, Wang Y, Guo D (2018) Efficient mining of frequent patterns on uncertain graphs. IEEE Transactions on Knowledge and Data Engineering 31(2):287\u2013300","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"1681_CR28","doi-asserted-by":"crossref","unstructured":"Coon JP, Badiu MA, G\u00fcnd\u00fcz D (2018) On the conditional entropy of wireless networks. In: 2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt), IEEE, pp 1\u20136","DOI":"10.23919\/WIOPT.2018.8362874"},{"key":"1681_CR29","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to algorithms. MIT press"},{"key":"1681_CR30","doi-asserted-by":"crossref","unstructured":"Dallachiesa M, Aggarwal C, Palpanas T (2014) Node classification in uncertain graphs. In: Proceedings of the 26th International Conference on Scientific and Statistical Database Management, ACM, p\u00a032","DOI":"10.1145\/2618243.2618277"},{"issue":"4","key":"1681_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3104067","volume":"50","author":"Y Deng","year":"2017","unstructured":"Deng Y, Ni Y, Li Z, Mu S, Zhang W (2017) Toward real-time ray tracing: A survey on hardware acceleration and microarchitecture techniques. ACM Computing Surveys (CSUR) 50(4):1\u201341","journal-title":"ACM Computing Surveys (CSUR)"},{"key":"1681_CR32","doi-asserted-by":"crossref","unstructured":"Dhulipala L, Blelloch G, Shun J (2017) Julienne: A framework for parallel graph algorithms using work-efficient bucketing. In: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, pp 293\u2013304","DOI":"10.1145\/3087556.3087580"},{"issue":"1","key":"1681_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3434393","volume":"8","author":"L Dhulipala","year":"2021","unstructured":"Dhulipala L, Blelloch GE, Shun J (2021) Theoretically efficient parallel graph algorithms can be fast and scalable. ACM Transactions on Parallel Computing (TOPC) 8(1):1\u201370","journal-title":"ACM Transactions on Parallel Computing (TOPC)"},{"key":"1681_CR34","unstructured":"Diestel R (2012) Graph theory, volume 173 of. Graduate texts in mathematics p\u00a07"},{"key":"1681_CR35","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1016\/j.ins.2014.10.030","volume":"295","author":"L Du","year":"2015","unstructured":"Du L, Li C, Chen H, Tan L, Zhang Y (2015) Probabilistic simrank computation over uncertain graphs. Information Sciences 295:521\u2013535","journal-title":"Information Sciences"},{"key":"1681_CR36","unstructured":"Erlebach T, Hoffmann M, Krizanc D, Mihal\u2019\u00c1k M, Raman R (2008) Computing minimum spanning trees with uncertainty. arXiv preprint arXiv:0802.2855"},{"key":"1681_CR37","unstructured":"Esfahani F, Srinivasan V, Thomo A, Wu K (2020) Nucleus decomposition in probabilistic graphs: Hardness and algorithms. arXiv preprint arXiv:2006.01958"},{"key":"1681_CR38","unstructured":"Ficken FA (2015) The simplex method of linear programming. Courier Dover Publications"},{"issue":"5","key":"1681_CR39","doi-asserted-by":"publisher","first-page":"880","DOI":"10.1109\/TKDE.2017.2780123","volume":"30","author":"C Frey","year":"2017","unstructured":"Frey C, Z\u00fcfle A, Emrich T, Renz M (2017) Efficient information flow maximization in probabilistic graphs. IEEE Transactions on Knowledge and Data Engineering 30(5):880\u2013894","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"1681_CR40","doi-asserted-by":"publisher","unstructured":"Frey C, Z\u00fcfle A, Emrich T, Renz M (2018) Efficient information flow maximization in probabilistic graphs (extended abstract). In: 34th IEEE International Conference on Data Engineering, ICDE 2018, Paris, France, April 16-19, 2018, pp 1801\u20131802, https:\/\/doi.org\/10.1109\/ICDE.2018.00258","DOI":"10.1109\/ICDE.2018.00258"},{"key":"1681_CR41","doi-asserted-by":"crossref","unstructured":"Fukunaga T (2019) Adaptive algorithm for finding connected dominating sets in uncertain graphs. arXiv preprint arXiv:1912.12665","DOI":"10.1109\/TNET.2019.2963361"},{"issue":"4","key":"1681_CR42","doi-asserted-by":"publisher","first-page":"1196","DOI":"10.1137\/16M1091666","volume":"48","author":"WS Fung","year":"2019","unstructured":"Fung WS, Hariharan R, Harvey NJ, Panigrahi D (2019) A general framework for graph sparsification. SIAM Journal on Computing 48(4):1196\u20131223","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"1681_CR43","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0304-4149(74)90001-5","volume":"2","author":"F G\u00f6bel","year":"1974","unstructured":"G\u00f6bel F, Jagers A (1974) Random walks on graphs. Stochastic processes and their applications 2(4):311\u2013336","journal-title":"Stochastic processes and their applications"},{"issue":"5","key":"1681_CR44","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1007\/s11280-015-0358-9","volume":"19","author":"Y Gu","year":"2016","unstructured":"Gu Y, Gao C, Wang L, Yu G (2016) Subgraph similarity maximal all-matching over a large uncertain graph. World Wide Web 19(5):755\u2013782","journal-title":"World Wide Web"},{"issue":"3","key":"1681_CR45","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1137\/18M1201846","volume":"48","author":"H Guo","year":"2019","unstructured":"Guo H, Jerrum M (2019) A polynomial-time approximation algorithm for all-terminal network reliability. SIAM Journal on Computing 48(3):964\u2013978","journal-title":"SIAM Journal on Computing"},{"key":"1681_CR46","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/j.ijar.2017.07.013","volume":"90","author":"Z Halim","year":"2017","unstructured":"Halim Z, Waqas M, Baig AR, Rashid A (2017) Efficient clustering of large uncertain graphs using neighborhood information. International Journal of Approximate Reasoning 90:274\u2013291","journal-title":"International Journal of Approximate Reasoning"},{"issue":"3","key":"1681_CR47","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/s12559-014-9295-7","volume":"7","author":"D Han","year":"2015","unstructured":"Han D, Hu Y, Ai S, Wang G (2015) Uncertain graph classification based on extreme learning machine. Cognitive Computation 7(3):346\u2013358","journal-title":"Cognitive Computation"},{"issue":"6","key":"1681_CR48","doi-asserted-by":"publisher","first-page":"667","DOI":"10.14778\/3311880.3311884","volume":"12","author":"K Han","year":"2019","unstructured":"Han K, Gui F, Xiao X, Tang J, He Y, Cao Z, Huang H (2019) Efficient and effective algorithms for clustering uncertain graphs. Proceedings of the VLDB Endowment 12(6):667\u2013680","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"3","key":"1681_CR49","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1109\/TR.2007.898572","volume":"56","author":"G Hardy","year":"2007","unstructured":"Hardy G, Lucet C, Limnios N (2007) K-terminal network reliability measures with binary decision diagrams. IEEE Transactions on Reliability 56(3):506\u2013515","journal-title":"IEEE Transactions on Reliability"},{"issue":"6","key":"1681_CR50","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1145\/362248.362272","volume":"16","author":"J Hopcroft","year":"1973","unstructured":"Hopcroft J, Tarjan R (1973) Algorithm 447: efficient algorithms for graph manipulation. Communications of the ACM 16(6):372\u2013378","journal-title":"Communications of the ACM"},{"key":"1681_CR51","doi-asserted-by":"crossref","unstructured":"Huang X, Lu W, Lakshmanan LV (2016) Truss decomposition of probabilistic graphs: Semantics and algorithms. In: Proceedings of the 2016 International Conference on Management of Data, pp 77\u201390","DOI":"10.1145\/2882903.2882913"},{"issue":"3","key":"1681_CR52","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"AK Jain","year":"1999","unstructured":"Jain AK, Murty MN, Flynn PJ (1999) Data clustering: a review. ACM computing surveys (CSUR) 31(3):264\u2013323","journal-title":"ACM computing surveys (CSUR)"},{"key":"1681_CR53","doi-asserted-by":"crossref","unstructured":"Jeh G, Widom J (2002) Simrank: a measure of structural-context similarity. In: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, ACM, pp 538\u2013543","DOI":"10.1145\/775047.775126"},{"key":"1681_CR54","doi-asserted-by":"crossref","unstructured":"Jin R, Liu L, Aggarwal CC (2011a) 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","DOI":"10.1145\/2020408.2020569"},{"issue":"9","key":"1681_CR55","doi-asserted-by":"publisher","first-page":"551","DOI":"10.14778\/2002938.2002941","volume":"4","author":"R Jin","year":"2011","unstructured":"Jin R, Liu L, Ding B, Wang H (2011b) Distance-constraint reachability computation in uncertain graphs. Proceedings of the VLDB Endowment 4(9):551\u2013562","journal-title":"Proceedings of the VLDB Endowment"},{"key":"1681_CR56","doi-asserted-by":"publisher","unstructured":"Kassiano V, Gounaris A, Papadopoulos AN, Tsichlas K (2016) Mining uncertain graphs: An overview. In: Algorithmic Aspects of Cloud Computing - Second International Workshop, ALGOCLOUD 2016, Aarhus, Denmark, August 22, 2016, Revised Selected Papers, pp 87\u2013116, https:\/\/doi.org\/10.1007\/978-3-319-57045-7_6","DOI":"10.1007\/978-3-319-57045-7_6"},{"issue":"12","key":"1681_CR57","doi-asserted-by":"publisher","first-page":"1922","DOI":"10.14778\/3229863.3236225","volume":"11","author":"X Ke","year":"2018","unstructured":"Ke X, Teo M, Khan A, Yalavarthi VK (2018) A demonstration of perc: probabilistic entity resolution with crowd errors. Proceedings of the VLDB Endowment 11(12):1922\u20131925","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"8","key":"1681_CR58","doi-asserted-by":"publisher","first-page":"864","DOI":"10.14778\/3324301.3324304","volume":"12","author":"X Ke","year":"2019","unstructured":"Ke X, Khan A, Quan LLH (2019) An in-depth comparison of st reliability algorithms over uncertain graphs. Proceedings of the VLDB Endowment 12(8):864\u2013876","journal-title":"Proceedings of the VLDB Endowment"},{"key":"1681_CR59","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (2003) Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, ACM, pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"key":"1681_CR60","doi-asserted-by":"crossref","unstructured":"Kenthapadi K, Mironov I, Thakurta AG (2019) Privacy-preserving data mining in industry. In: Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining, pp 840\u2013841","DOI":"10.1145\/3289600.3291384"},{"key":"1681_CR61","unstructured":"Khan A, Bonchi F, Gionis A, Gullo F (2014) Fast reliability search in uncertain graphs. In: EDBT, pp 535\u2013546"},{"issue":"11","key":"1681_CR62","first-page":"2078","volume":"30","author":"A Khan","year":"2018","unstructured":"Khan A, Bonchi F, Gullo F, Nufer A (2018a) Conditional reliability in uncertain graphs. IEEE Transactions on Knowledge and Data Engineering 30(11):2078\u20132092","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"1","key":"1681_CR63","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-031-01860-2","volume":"10","author":"A Khan","year":"2018","unstructured":"Khan A, Ye Y, Chen L (2018b) On uncertain graphs. Synthesis Lectures on Data Management 10(1):1\u201394","journal-title":"Synthesis Lectures on Data Management"},{"key":"1681_CR64","doi-asserted-by":"crossref","unstructured":"Kloda T, Solieri M, Mancuso R, Capodieci N, Valente P, Bertogna M (2019) Deterministic memory hierarchy and virtualization for modern multi-core embedded systems. In: 2019 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS), IEEE, pp 1\u201314","DOI":"10.1109\/RTAS.2019.00009"},{"issue":"2","key":"1681_CR65","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1109\/TKDE.2011.243","volume":"25","author":"G Kollios","year":"2011","unstructured":"Kollios G, Potamias M, Terzi E (2011) Clustering large probabilistic graphs. IEEE Transactions on Knowledge and Data Engineering 25(2):325\u2013336","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"1681_CR66","doi-asserted-by":"crossref","unstructured":"Kong X, Yu PS, Wang X, Ragin AB (2013) Discriminative feature selection for uncertain graph classification. In: Proceedings of the 2013 SIAM International Conference on Data Mining, SIAM, pp 82\u201393","DOI":"10.1137\/1.9781611972832.10"},{"issue":"3","key":"1681_CR67","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10618-005-0003-9","volume":"11","author":"M Kuramochi","year":"2005","unstructured":"Kuramochi M, Karypis G (2005) Finding frequent patterns in a large sparse graph. Data mining and knowledge discovery 11(3):243\u2013271","journal-title":"Data mining and knowledge discovery"},{"issue":"11","key":"1681_CR68","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1140\/epjb\/e2015-60481-x","volume":"88","author":"G Laurent","year":"2015","unstructured":"Laurent G, Saram\u00e4ki J, Karsai M (2015) From calls to communities: a model for time-varying social networks. The European Physical Journal B 88(11):301","journal-title":"The European Physical Journal B"},{"key":"1681_CR69","doi-asserted-by":"publisher","first-page":"133","DOI":"10.14778\/2535568.2448946","volume":"6","author":"J Lee","year":"2012","unstructured":"Lee J, Han WS, Kasperovics R, Lee JH (2012) An in-depth comparison of subgraph isomorphism algorithms in graph databases. Proceedings of the VLDB Endowment, VLDB Endowment 6:133\u2013144","journal-title":"Proceedings of the VLDB Endowment, VLDB Endowment"},{"key":"1681_CR70","unstructured":"Lewis HR (1983) Computers and intractability. a guide to the theory of np-completeness"},{"key":"1681_CR71","doi-asserted-by":"crossref","unstructured":"Li C, Han J, He G, Jin X, Sun Y, Yu Y, Wu T (2010a) Fast computation of simrank for static and dynamic information networks. In: Proceedings of the 13th International Conference on Extending Database Technology, ACM, pp 465\u2013476","DOI":"10.1145\/1739041.1739098"},{"issue":"6","key":"1681_CR72","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1007\/s00778-012-0268-8","volume":"21","author":"J Li","year":"2012","unstructured":"Li J, Zou Z, Gao H (2012) Mining frequent subgraphs over uncertain graph databases under probabilistic semantics. The VLDB Journal 21(6):753\u2013777","journal-title":"The VLDB Journal"},{"key":"1681_CR73","doi-asserted-by":"crossref","unstructured":"Li L, Wang H, Gao H, Li J (2010b) Eif: a framework of effective entity identification. In: International conference on web-age information management, Springer, pp 717\u2013728","DOI":"10.1007\/978-3-642-14246-8_68"},{"key":"1681_CR74","doi-asserted-by":"crossref","unstructured":"Li RH, Yu JX, Mao R, Jin T (2014) Efficient and accurate query evaluation on uncertain graphs via recursive stratified sampling. In: 2014 IEEE 30th International Conference on Data Engineering, IEEE, pp 892\u2013903","DOI":"10.1109\/ICDE.2014.6816709"},{"issue":"2","key":"1681_CR75","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1109\/TKDE.2015.2485212","volume":"28","author":"RH Li","year":"2015","unstructured":"Li RH, Yu JX, Mao R, Jin T (2015) Recursive stratified sampling: A new framework for query evaluation on uncertain graphs. IEEE Transactions on Knowledge and Data Engineering 28(2):468\u2013482","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"1681_CR76","doi-asserted-by":"crossref","unstructured":"Li RH, Dai Q, Wang G, Ming Z, Qin L, Yu JX (2019) Improved algorithms for maximal clique search in uncertain networks. In: 2019 IEEE 35th International Conference on Data Engineering (ICDE), IEEE, pp 1178\u20131189","DOI":"10.1109\/ICDE.2019.00108"},{"key":"1681_CR77","doi-asserted-by":"crossref","unstructured":"Li X, Chen H (2009) Recommendation as link prediction: a graph kernel-based machine learning approach. In: Proceedings of the 9th ACM\/IEEE-CS joint conference on Digital libraries, ACM, pp 213\u2013216","DOI":"10.1145\/1555400.1555433"},{"key":"1681_CR78","doi-asserted-by":"crossref","unstructured":"Li Y, Fan J, Zhang D, Tan KL (2017) Discovering your selling points: Personalized social influential tags exploration. In: Proceedings of the 2017 ACM International Conference on Management of Data, pp 619\u2013634","DOI":"10.1145\/3035918.3035952"},{"issue":"7","key":"1681_CR79","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1002\/asi.20591","volume":"58","author":"D Liben-Nowell","year":"2007","unstructured":"Liben-Nowell D, Kleinberg J (2007) The link-prediction problem for social networks. Journal of the American society for information science and technology 58(7):1019\u20131031","journal-title":"Journal of the American society for information science and technology"},{"key":"1681_CR80","doi-asserted-by":"crossref","unstructured":"Liu L, Jin R, Aggarwal C, Shen Y (2012) Reliable clustering on uncertain graphs. In: 2012 IEEE 12th International Conference on Data Mining, IEEE, pp 459\u2013468","DOI":"10.1109\/ICDM.2012.11"},{"issue":"2","key":"1681_CR81","doi-asserted-by":"publisher","first-page":"155","DOI":"10.14778\/3364324.3364330","volume":"13","author":"C Ma","year":"2019","unstructured":"Ma C, Cheng R, Lakshmanan LV, Grubenmann T, Fang Y, Li X (2019) Linc: a motif counting algorithm for uncertain graphs. Proceedings of the VLDB Endowment 13(2):155\u2013168","journal-title":"Proceedings of the VLDB Endowment"},{"key":"1681_CR82","doi-asserted-by":"crossref","unstructured":"Ma C, Cheng R, Lakshmanan LV, Grubenmann T, Fang Y, Li X (2020) Linc: A motif counting algorithm for uncertain graphs. Proceedings of the VLDB Endowment 13(2)","DOI":"10.14778\/3364324.3364330"},{"key":"1681_CR83","doi-asserted-by":"crossref","unstructured":"Malewicz G, Austern MH, Bik AJ, Dehnert JC, Horn I, Leiser N, Czajkowski G (2010) Pregel: a system for large-scale graph processing. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of data, pp 135\u2013146","DOI":"10.1145\/1807167.1807184"},{"key":"1681_CR84","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.is.2013.10.006","volume":"45","author":"Y Malkov","year":"2014","unstructured":"Malkov Y, Ponomarenko A, Logvinov A, Krylov V (2014) Approximate nearest neighbor algorithm based on navigable small world graphs. Information Systems 45:61\u201368","journal-title":"Information Systems"},{"issue":"2","key":"1681_CR85","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/3044713","volume":"42","author":"S Maniu","year":"2017","unstructured":"Maniu S, Cheng R, Senellart P (2017) An indexing framework for queries on probabilistic graphs. ACM Transactions on Database Systems (TODS) 42(2):13","journal-title":"ACM Transactions on Database Systems (TODS)"},{"issue":"4","key":"1681_CR86","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1145\/3012704","volume":"49","author":"V Mart\u00ednez","year":"2017","unstructured":"Mart\u00ednez V, Berzal F, Cubero JC (2017) A survey of link prediction in complex networks. ACM Computing Surveys (CSUR) 49(4):69","journal-title":"ACM Computing Surveys (CSUR)"},{"issue":"2","key":"1681_CR87","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2818185","volume":"48","author":"RR McCune","year":"2015","unstructured":"McCune RR, Weninger T, Madey G (2015) Thinking like a vertex: a survey of vertex-centric frameworks for large-scale distributed graph processing. ACM Computing Surveys (CSUR) 48(2):1\u201339","journal-title":"ACM Computing Surveys (CSUR)"},{"issue":"4","key":"1681_CR88","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1137\/16M1088375","volume":"46","author":"N Megow","year":"2017","unstructured":"Megow N, Mei\u00dfner J, Skutella M (2017) Randomization helps computing a minimum spanning tree under uncertainty. SIAM Journal on Computing 46(4):1217\u20131240","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"1681_CR89","doi-asserted-by":"publisher","first-page":"816","DOI":"10.1137\/S0097539701383443","volume":"32","author":"RR Mettu","year":"2003","unstructured":"Mettu RR, Plaxton CG (2003) The online median problem. SIAM Journal on Computing 32(3):816\u2013832","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"1681_CR90","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1109\/TNN.2009.2036259","volume":"21","author":"Y Miche","year":"2009","unstructured":"Miche Y, Sorjamaa A, Bas P, Simula O, Jutten C, Lendasse A (2009) Op-elm: optimally pruned extreme learning machine. IEEE transactions on neural networks 21(1):158\u2013162","journal-title":"IEEE transactions on neural networks"},{"key":"1681_CR91","doi-asserted-by":"crossref","unstructured":"Moradi N, Kayvanfar V, Rafiee M (2021) An efficient population-based simulated annealing algorithm for 0\u20131 knapsack problem. Engineering with Computers pp 1\u201320","DOI":"10.1007\/s00366-020-01240-3"},{"key":"1681_CR92","doi-asserted-by":"crossref","unstructured":"Mukherjee AP, Xu P, Tirthapura S (2015) Mining maximal cliques from an uncertain graph. In: 2015 IEEE 31st International Conference on Data Engineering, IEEE, pp 243\u2013254","DOI":"10.1109\/ICDE.2015.7113288"},{"issue":"3","key":"1681_CR93","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1109\/TKDE.2016.2527643","volume":"29","author":"AP Mukherjee","year":"2016","unstructured":"Mukherjee AP, Xu P, Tirthapura S (2016) Enumeration of maximal cliques from an uncertain graph. IEEE Transactions on Knowledge and Data Engineering 29(3):543\u2013555","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"3","key":"1681_CR94","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1109\/TKDE.2016.2527643","volume":"29","author":"AP Mukherjee","year":"2017","unstructured":"Mukherjee AP, Xu P, Tirthapura S (2017) Enumeration of maximal cliques from an uncertain graph. IEEE Trans Knowl Data Eng 29(3):543\u2013555. https:\/\/doi.org\/10.1109\/TKDE.2016.2527643","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1681_CR95","doi-asserted-by":"crossref","unstructured":"Parchas P, Gullo F, Papadias D, Bonchi F (2014) The pursuit of a good possible world: extracting representative instances of uncertain graphs. In: Proceedings of the 2014 ACM SIGMOD international conference on management of data, ACM, pp 967\u2013978","DOI":"10.1145\/2588555.2593668"},{"issue":"3","key":"1681_CR96","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/2818182","volume":"40","author":"P Parchas","year":"2015","unstructured":"Parchas P, Gullo F, Papadias D, Bonchi F (2015) Uncertain graph processing through representative instances. ACM Transactions on Database Systems (TODS) 40(3):20","journal-title":"ACM Transactions on Database Systems (TODS)"},{"issue":"12","key":"1681_CR97","doi-asserted-by":"publisher","first-page":"2435","DOI":"10.1109\/TKDE.2018.2819651","volume":"30","author":"P Parchas","year":"2018","unstructured":"Parchas P, Papailiou N, Papadias D, Bonchi F (2018) Uncertain graph sparsification. IEEE Transactions on Knowledge and Data Engineering 30(12):2435\u20132449","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"1","key":"1681_CR98","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1002\/jgt.3190130114","volume":"13","author":"D Peleg","year":"1989","unstructured":"Peleg D, Sch\u00e4ffer AA (1989) Graph spanners. Journal of graph theory 13(1):99\u2013116","journal-title":"Graph spanners. Journal of graph theory"},{"key":"1681_CR99","doi-asserted-by":"crossref","unstructured":"Peng Y, Zhang Y, Zhang W, Lin X, Qin L (2018) Efficient probabilistic k-core computation on uncertain graphs. In: 2018 IEEE 34th International Conference on Data Engineering (ICDE), IEEE, pp 1192\u20131203","DOI":"10.1109\/ICDE.2018.00110"},{"key":"1681_CR100","unstructured":"Potamias M, Bonchi F, Gionis A, Kollios G (2009) Nearest-neighbor queries in probabilistic graphs. Boston University Computer Science Department, Tech. rep"},{"issue":"1\u20132","key":"1681_CR101","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. Proceedings of the VLDB Endowment 3(1\u20132):997\u20131008","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"4","key":"1681_CR102","doi-asserted-by":"publisher","first-page":"3129","DOI":"10.3233\/JIFS-18263","volume":"36","author":"A Rashid","year":"2019","unstructured":"Rashid A, Kamran M, Halim Z (2019) A top down approach to enumerate $$\\alpha $$-maximal cliques in uncertain graphs. Journal of Intelligent & Fuzzy Systems 36(4):3129\u20133141","journal-title":"Journal of Intelligent & Fuzzy Systems"},{"key":"1681_CR103","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1145\/568271.223794","volume":"24","author":"N Roussopoulos","year":"1995","unstructured":"Roussopoulos N, Kelley S, Vincent F (1995) Nearest neighbor queries. ACM sigmod record, ACM 24:71\u201379","journal-title":"ACM sigmod record, ACM"},{"key":"1681_CR104","unstructured":"Sadeh G, Cohen E, Kaplan H (2019) Sample complexity bounds for influence maximization. arXiv preprint arXiv:1907.13301"},{"key":"1681_CR105","doi-asserted-by":"crossref","unstructured":"Sariyuce AE, Seshadhri C, Pinar A, Catalyurek UV (2015) Finding the hierarchy of dense subgraphs using nucleus decompositions. In: Proceedings of the 24th International Conference on World Wide Web, pp 927\u2013937","DOI":"10.1145\/2736277.2741640"},{"key":"1681_CR106","unstructured":"Sasaki Y, Fujiwara Y, Onizuka M (2019) Efficient network reliability computation in uncertain graphs. In: EDBT, pp 337\u2013348"},{"issue":"1","key":"1681_CR107","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1109\/TVCG.2016.2598919","volume":"23","author":"C Schulz","year":"2016","unstructured":"Schulz C, Nocaj A, Goertler J, Deussen O, Brandes U, Weiskopf D (2016) Probabilistic graph layout for uncertain network visualization. IEEE transactions on visualization and computer graphics 23(1):531\u2013540","journal-title":"IEEE transactions on visualization and computer graphics"},{"key":"1681_CR108","doi-asserted-by":"crossref","unstructured":"Sharara H, Sopan A, Namata G, Getoor L, Singh L (2011) G-pare: a visual analytic tool for comparative analysis of uncertain graphs. In: 2011 IEEE Conference on Visual Analytics Science and Technology (VAST), IEEE, pp 61\u201370","DOI":"10.1109\/VAST.2011.6102442"},{"issue":"6","key":"1681_CR109","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3128571","volume":"50","author":"X Shi","year":"2018","unstructured":"Shi X, Zheng Z, Zhou Y, Jin H, He L, Liu B, Hua QS (2018) Graph processing on gpus: A survey. ACM Computing Surveys (CSUR) 50(6):1\u201335","journal-title":"ACM Computing Surveys (CSUR)"},{"issue":"6","key":"1681_CR110","doi-asserted-by":"publisher","first-page":"1913","DOI":"10.1137\/080734029","volume":"40","author":"DA Spielman","year":"2011","unstructured":"Spielman DA, Srivastava N (2011) Graph sparsification by effective resistances. SIAM Journal on Computing 40(6):1913\u20131926","journal-title":"SIAM Journal on Computing"},{"key":"1681_CR111","first-page":"354","volume":"2021","author":"Z Sun","year":"2021","unstructured":"Sun Z, Huang X, Xu J, Bonchi F (2021) Efficient probabilistic truss indexing on uncertain graphs. Proceedings of the Web Conference 2021:354\u2013366","journal-title":"Proceedings of the Web Conference"},{"key":"1681_CR112","doi-asserted-by":"crossref","unstructured":"Taranto C, Di\u00a0Mauro N, Esposito F (2012) Uncertain (multi) graphs for personalization services in digital libraries. In: Italian Research Conference on Digital Libraries, Springer, pp 141\u2013152","DOI":"10.1007\/978-3-642-35834-0_15"},{"issue":"2","key":"1681_CR113","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1137\/S0097539701388884","volume":"34","author":"M Thorup","year":"2005","unstructured":"Thorup M (2005) Quick k-median, k-center, and facility location for sparse graphs. SIAM Journal on Computing 34(2):405\u2013432","journal-title":"SIAM Journal on Computing"},{"key":"1681_CR114","doi-asserted-by":"crossref","unstructured":"Tian Y, Yan J, Hu J, Wu Z (2018) A privacy preserving model in uncertain graph mining. In: 2018 International Conference on Networking and Network Applications (NaNA), IEEE, pp 102\u2013106","DOI":"10.1109\/NANA.2018.8648772"},{"issue":"1\u20136","key":"1681_CR115","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/BF01758773","volume":"7","author":"J Westbrook","year":"1992","unstructured":"Westbrook J, Tarjan RE (1992) Maintaining bridge-connected and biconnected components on-line. Algorithmica 7(1\u20136):433\u2013464","journal-title":"Algorithmica"},{"key":"1681_CR116","doi-asserted-by":"crossref","unstructured":"Whalen K, Sadkhin B, Davidson D, Gerlt J (2015) Sequence similarity networks for the protein universe. The FASEB Journal 29(1_supplement):573\u201317","DOI":"10.1096\/fasebj.29.1_supplement.573.17"},{"key":"1681_CR117","doi-asserted-by":"crossref","unstructured":"Xiang J, Guo C, Aboulnaga A (2013) Scalable maximum clique computation using mapreduce. In: 2013 IEEE 29th International Conference on Data Engineering (ICDE), IEEE, pp 74\u201385","DOI":"10.1109\/ICDE.2013.6544815"},{"key":"1681_CR118","doi-asserted-by":"crossref","unstructured":"Xiao D, Eltabakh MY, Kong X (2018) Sharing uncertain graphs using syntactic private graph models. In: 2018 IEEE 34th International Conference on Data Engineering (ICDE), IEEE, pp 1336\u20131339","DOI":"10.1109\/ICDE.2018.00144"},{"key":"1681_CR119","unstructured":"Yalavarthi VK, Ke X, Khan A (2017a) Probabilistic entity resolution with imperfect crowd. CoRR"},{"key":"1681_CR120","doi-asserted-by":"crossref","unstructured":"Yalavarthi VK, Ke X, Khan A (2017b) Select your questions wisely: For entity resolution with crowd errors. In: Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, ACM, pp 317\u2013326","DOI":"10.1145\/3132847.3132876"},{"key":"1681_CR121","doi-asserted-by":"crossref","unstructured":"Yan X, Yu PS, Han J (2005) Substructure similarity search in graph databases. In: Proceedings of the 2005 ACM SIGMOD international conference on Management of data, ACM, pp 766\u2013777","DOI":"10.1145\/1066157.1066244"},{"key":"1681_CR122","doi-asserted-by":"crossref","unstructured":"Yin X, Han J, Philip SY (2007) Object distinction: Distinguishing objects with identical names. In: 2007 IEEE 23rd International Conference on Data Engineering, IEEE, pp 1242\u20131246","DOI":"10.1109\/ICDE.2007.368983"},{"issue":"11","key":"1681_CR123","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 (2011a) Efficient subgraph search over large uncertain graphs. Proc VLDB Endowment 4(11):876\u2013886","journal-title":"Proc VLDB Endowment"},{"issue":"11","key":"1681_CR124","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 (2011b) Efficient subgraph search over large uncertain graphs. Proc VLDB Endowment 4(11):876\u2013886","journal-title":"Proc VLDB Endowment"},{"key":"1681_CR125","doi-asserted-by":"crossref","unstructured":"Yuan Y, Wang G, Chen L, Wang H (2012) Efficient subgraph similarity search on large probabilistic graph databases. arXiv preprint arXiv:1205.6692","DOI":"10.14778\/2311906.2311908"},{"key":"1681_CR126","doi-asserted-by":"crossref","unstructured":"Yuan Y, Wang G, Chen L (2014) Pattern match query in a large uncertain graph. In: Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, pp 519\u2013528","DOI":"10.1145\/2661829.2661868"},{"issue":"2","key":"1681_CR127","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s00778-014-0373-y","volume":"24","author":"Y Yuan","year":"2015","unstructured":"Yuan Y, Wang G, Chen L, Wang H (2015) Graph similarity search on large uncertain graph databases. The VLDB Journal 24(2):271\u2013296","journal-title":"The VLDB Journal"},{"key":"1681_CR128","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/j.ins.2015.12.034","volume":"339","author":"Y Yuan","year":"2016","unstructured":"Yuan Y, Wang G, Chen L, Ning B (2016) Efficient pattern matching on big uncertain graphs. Information Sciences 339:369\u2013394","journal-title":"Information Sciences"},{"key":"1681_CR129","doi-asserted-by":"crossref","unstructured":"Zeng X, Zhang S, Tang B (2020) Rcelf: A residual-based approach for influence maximization problem. arXiv preprint arXiv:2001.06630","DOI":"10.1016\/j.is.2021.101828"},{"key":"1681_CR130","doi-asserted-by":"crossref","unstructured":"Zhang A, Zou Z, Li J, Gao H (2016) Minimum spanning tree on uncertain graphs. In: International Conference on Web Information Systems Engineering, Springer, pp 259\u2013274","DOI":"10.1007\/978-3-319-48743-4_21"},{"key":"1681_CR131","doi-asserted-by":"publisher","unstructured":"Zhang C, Za\u00efane OR (2019) Neighbor-based link prediction with edge uncertainty. In: Advances in Knowledge Discovery and Data Mining - 23rd Pacific-Asia Conference, PAKDD 2019, Macau, China, April 14-17, 2019, Proceedings, Part II, pp 462\u2013474, https:\/\/doi.org\/10.1007\/978-3-030-16145-3_36","DOI":"10.1007\/978-3-030-16145-3_36"},{"issue":"3","key":"1681_CR132","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1109\/TCBB.2013.2297915","volume":"11","author":"B Zhao","year":"2014","unstructured":"Zhao B, Wang J, Li M, Wu FX, Pan Y (2014) Detecting protein complexes based on uncertain graph model. IEEE\/ACM Transactions on Computational Biology and Bioinformatics (TCBB) 11(3):486\u2013497","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics (TCBB)"},{"key":"1681_CR133","doi-asserted-by":"crossref","unstructured":"Zhu K, Zhang W, Zhu G, Zhang Y, Lin X (2011) Bmc: an efficient method to evaluate probabilistic reachability queries. In: International Conference on Database Systems for Advanced Applications, Springer, pp 434\u2013449","DOI":"10.1007\/978-3-642-20149-3_32"},{"key":"1681_CR134","doi-asserted-by":"crossref","unstructured":"Zhu R, Zou Z, Li J (2015) Top-k reliability search on uncertain graphs. In: 2015 IEEE International Conference on Data Mining, IEEE, pp 659\u2013668","DOI":"10.1109\/ICDM.2015.64"},{"key":"1681_CR135","doi-asserted-by":"crossref","unstructured":"Zhu R, Zou Z, Li J (2016a) Simrank computation on uncertain graphs. In: 2016 IEEE 32nd International Conference on Data Engineering (ICDE), IEEE, pp 565\u2013576","DOI":"10.1109\/ICDE.2016.7498271"},{"issue":"11","key":"1681_CR136","doi-asserted-by":"publisher","first-page":"2522","DOI":"10.1109\/TKDE.2017.2725275","volume":"29","author":"R Zhu","year":"2017","unstructured":"Zhu R, Zou Z, Li J (2017) Simrank on uncertain graphs. IEEE Transactions on Knowledge and Data Engineering 29(11):2522\u20132536","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"1681_CR137","unstructured":"Zhu X, Chen W, Zheng W, Ma X (2016b) Gemini: A computation-centric distributed graph processing system. In: 12th $$\\{$$USENIX$$\\}$$ Symposium on Operating Systems Design and Implementation ($$\\{$$OSDI$$\\}$$ 16), pp 301\u2013316"},{"key":"1681_CR138","unstructured":"Zou Z (2013) Polynomial-time algorithm for finding densest subgraphs in uncertain graphs. In: Proceedings of MLG Workshop"},{"issue":"1","key":"1681_CR139","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. Knowledge and Information Systems 50(1):197\u2013230","journal-title":"Knowledge and Information Systems"},{"key":"1681_CR140","doi-asserted-by":"crossref","unstructured":"Zou Z, Li J, Gao H, Zhang S (2009) Frequent subgraph pattern mining on uncertain graph data. In: Proceedings of the 18th ACM conference on Information and knowledge management, ACM, pp 583\u2013592","DOI":"10.1145\/1645953.1646028"},{"key":"1681_CR141","doi-asserted-by":"crossref","unstructured":"Zou Z, Gao H, Li J (2010a) Discovering frequent subgraphs over uncertain graph databases under probabilistic semantics. In: Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, ACM, pp 633\u2013642","DOI":"10.1145\/1835804.1835885"},{"key":"1681_CR142","doi-asserted-by":"crossref","unstructured":"Zou Z, Li J, Gao H, Zhang S (2010b) Finding top-k maximal cliques in an uncertain graph. In: 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010), IEEE, pp 649\u2013652","DOI":"10.1109\/ICDE.2010.5447891"},{"key":"1681_CR143","doi-asserted-by":"crossref","unstructured":"Zou Z, Li F, Li J, Li Y (2017) Scalable processing of massive uncertain graph data: A simultaneous processing approach. In: 2017 IEEE 33rd International Conference on Data Engineering (ICDE), IEEE, pp 183\u2013186","DOI":"10.1109\/ICDE.2017.70"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-022-01681-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-022-01681-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-022-01681-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,15]],"date-time":"2022-11-15T02:14:20Z","timestamp":1668478460000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-022-01681-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,28]]},"references-count":143,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["1681"],"URL":"https:\/\/doi.org\/10.1007\/s10115-022-01681-w","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,28]]},"assertion":[{"value":"7 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 April 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 June 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}