{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:48:30Z","timestamp":1742914110248,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031592041"},{"type":"electronic","value":"9783031592058"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-59205-8_6","type":"book-chapter","created":{"date-parts":[[2024,4,28]],"date-time":"2024-04-28T15:01:38Z","timestamp":1714316498000},"page":"80-96","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Computation of\u00a0K-Edge Connected Components: An Empirical Analysis"],"prefix":"10.1007","author":[{"given":"Hanieh","family":"Sadri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesh","family":"Srinivasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Thomo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,4,29]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Akiba, T., Iwata, Y., Yoshida, Y.: Linear-time enumeration of maximal k-edge-connected subgraphs in large networks by random contraction. In: CIKM, pp. 909\u2013918 (2013)","DOI":"10.1145\/2505515.2505751"},{"issue":"2","key":"6_CR2","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1038\/nrg1272","volume":"5","author":"AL Barab\u00e1si","year":"2004","unstructured":"Barab\u00e1si, A.L., Oltvai, Z.N.: Network biology: understanding the cell\u2019s functional organization. Nat. Rev. Genet. 5(2), 101\u2013113 (2004)","journal-title":"Nat. Rev. Genet."},{"issue":"1\u20137","key":"6_CR3","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S Brin","year":"1998","unstructured":"Brin, S., Page, L.: Anatomy of a large-scale hypertextual web search engine. Comput. Netw. ISDN Syst. 30(1\u20137), 107\u2013117 (1998)","journal-title":"Comput. Netw. ISDN Syst."},{"key":"6_CR4","first-page":"1","volume":"15","author":"L Chang","year":"2023","unstructured":"Chang, L., Wang, Z.: A near-optimal approach to edge connectivity-based hierarchical graph decomposition. VLDB J. 15, 1\u201323 (2023)","journal-title":"VLDB J."},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Chang, L., Yu, J.X., Qin, L., Lin, X., Liu, C., Liang, W.: Efficiently computing k-edge connected components via graph decomposition. In: SIGMOD, pp. 205\u2013216 (2013)","DOI":"10.1145\/2463676.2465323"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Chechik, S., Hansen, T.D., Italiano, G.F., Loitzenbauer, V., Parotsidis, N.: Faster algorithms for computing maximal 2-connected subgraphs in sparse directed graphs. In: SODA, pp. 1900\u20131918 (2017)","DOI":"10.1137\/1.9781611974782.124"},{"key":"6_CR7","doi-asserted-by":"publisher","unstructured":"Delling, D., Sanders, P., Schultes, D., Wagner, D.: Engineering route planning algorithms. In: Lerner, J., Wagner, D., Zweig, K.A. (eds.) Algorithmics of Large and Complex Networks. LNCS, vol. 5515, pp. 117\u2013139. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02094-0_7","DOI":"10.1007\/978-3-642-02094-0_7"},{"issue":"2\u20133","key":"6_CR8","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s10619-022-07415-9","volume":"40","author":"F Esfahani","year":"2022","unstructured":"Esfahani, F., Daneshmand, M., Srinivasan, V., Thomo, A., Wu, K.: Scalable probabilistic truss decomposition using central limit theorem and h-index. Distrib. Parallel Databases 40(2\u20133), 299\u2013333 (2022)","journal-title":"Distrib. Parallel Databases"},{"key":"6_CR9","unstructured":"Esfahani, F., Srinivasan, V., Thomo, A., Wu, K.: Efficient computation of probabilistic core decomposition at web-scale. In: EDBT, pp. 325\u2013336 (2019)"},{"issue":"3\u20135","key":"6_CR10","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3\u20135), 75\u2013174 (2010)","journal-title":"Phys. Rep."},{"issue":"1","key":"6_CR11","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1145\/122413.122416","volume":"22","author":"Z Galil","year":"1991","unstructured":"Galil, Z., Italiano, G.F.: Reducing edge connectivity to vertex connectivity. ACM SIGACT News 22(1), 57\u201361 (1991)","journal-title":"ACM SIGACT News"},{"issue":"6833","key":"6_CR12","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1038\/35075138","volume":"411","author":"H Jeong","year":"2001","unstructured":"Jeong, H., Mason, S.P., Barab\u00e1si, A.L., Oltvai, Z.N.: Lethality and centrality in protein networks. Nature 411(6833), 41\u201342 (2001)","journal-title":"Nature"},{"key":"6_CR13","unstructured":"Karger, D.R.: Global min-cuts in RNC, and other ramifications of a simple min-cut algorithm. In: SODA, pp. 21\u201330 (1993)"},{"issue":"1","key":"6_CR14","first-page":"13","volume":"9","author":"W Khaouid","year":"2015","unstructured":"Khaouid, W., Barsky, M., Venkatesh, S., Thomo, A.: K-core decomposition of large networks on a single PC. PVLDB 9(1), 13\u201323 (2015)","journal-title":"PVLDB"},{"key":"6_CR15","first-page":"985","volume":"11","author":"J Leskovec","year":"2010","unstructured":"Leskovec, J., Chakrabarti, D., Kleinberg, J., Faloutsos, C., Ghahramani, Z.: Kronecker graphs: an approach to modeling networks. J. Mach. Learn. Res. 11, 985\u20131042 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Mislove, A., Marcon, M., Gummadi, K.P., Druschel, P., Bhattacharjee, B.: Measurement and analysis of online social networks. In: IMC 2007, pp. 29\u201342 (2007)","DOI":"10.1145\/1298306.1298311"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BF03167564","volume":"9","author":"H Nagamochi","year":"1992","unstructured":"Nagamochi, H., Ibaraki, T.: A linear time algorithm for computing 3-edge-connected components in a multigraph. Jpn. J. Ind. Appl. Math. 9, 163\u2013180 (1992)","journal-title":"Jpn. J. Ind. Appl. Math."},{"key":"6_CR18","unstructured":"Nagamochi, H., Watanabe, T.: Computing k-edge-connected components of a multigraph. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 76(4), 513\u2013517 (1993)"},{"issue":"2","key":"6_CR19","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"M Newman","year":"2003","unstructured":"Newman, M.: The structure and function of complex networks. SIAM Rev. 45(2), 167\u2013256 (2003)","journal-title":"SIAM Rev."},{"key":"6_CR20","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: bringing order to the web. In: Stanford InfoLab (1999)"},{"issue":"3","key":"6_CR21","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"S Seidman","year":"1983","unstructured":"Seidman, S.: Network structure and minimum degree. Soc. Netw. 5(3), 269\u2013287 (1983)","journal-title":"Soc. Netw."},{"issue":"21","key":"6_CR22","doi-asserted-by":"publisher","first-page":"12123","DOI":"10.1073\/pnas.2032324100","volume":"100","author":"V Spirin","year":"2003","unstructured":"Spirin, V., Mirny, L.A.: Protein complexes and functional modules in molecular networks. Proc. Natl. Acad. Sci. 100(21), 12123\u201312128 (2003)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"6_CR23","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.knosys.2016.08.006","volume":"111","author":"H Sun","year":"2016","unstructured":"Sun, H., et al.: Efficient k-edge connected component detection through an early merging and splitting strategy. Knowl. Based Syst. 111, 63\u201372 (2016)","journal-title":"Knowl. Based Syst."},{"issue":"1","key":"6_CR24","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.jda.2008.04.003","volume":"7","author":"YH Tsin","year":"2009","unstructured":"Tsin, Y.H.: Yet another optimal algorithm for 3-edge-connectivity. J. Discr. Algorithms 7(1), 130\u2013146 (2009)","journal-title":"J. Discr. Algorithms"},{"issue":"9","key":"6_CR25","first-page":"812","volume":"5","author":"J Wang","year":"2012","unstructured":"Wang, J., Cheng, J.: Truss decomposition in massive networks. PVLDB 5(9), 812\u2013823 (2012)","journal-title":"PVLDB"},{"issue":"9","key":"6_CR26","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0136264","volume":"10","author":"T Wang","year":"2015","unstructured":"Wang, T., Zhang, Y., Chin, F.Y., Ting, H.F., Tsin, Y.H., Poon, S.H.: A simple algorithm for finding all k-edge-connected components. PLoS ONE 10(9), e0136264 (2015)","journal-title":"PLoS ONE"},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"Wu, J., Goshulak, A., Srinivasan, V., Thomo, A.: K-truss decomposition of large networks on a single consumer-grade machine. In: ASONAM, pp. 873\u2013880 (2018)","DOI":"10.1109\/ASONAM.2018.8508642"},{"issue":"1","key":"6_CR28","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10115-013-0693-z","volume":"42","author":"J Yang","year":"2015","unstructured":"Yang, J., Leskovec, J.: Defining and evaluating network communities based on ground-truth. Knowl. Inf. Syst. 42(1), 181\u2013213 (2015)","journal-title":"Knowl. Inf. Syst."},{"key":"6_CR29","doi-asserted-by":"crossref","unstructured":"Zhou, R., Liu, C., Yu, J.X., Liang, W., Chen, B., Li, J.: Finding maximal k-edge-connected subgraphs from a large graph. In: Proceedings of the 15th International Conference on Extending Database Technology, pp. 480\u2013491 (2012)","DOI":"10.1145\/2247596.2247652"}],"container-title":["Lecture Notes in Computer Science","Modelling and Mining Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-59205-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,10]],"date-time":"2024-05-10T16:02:32Z","timestamp":1715356952000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-59205-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031592041","9783031592058"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-59205-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"29 April 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Models for the Web-Graph","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Warsaw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waw2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/math.torontomu.ca\/waw2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}