{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T18:51:38Z","timestamp":1755802298949,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":54,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,3,10]],"date-time":"2025-03-10T00:00:00Z","timestamp":1741564800000},"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":[[2025,3,10]]},"DOI":"10.1145\/3701551.3703556","type":"proceedings-article","created":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T12:30:16Z","timestamp":1740573016000},"page":"735-743","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["An Edge-Based Decomposition Framework for Temporal Networks"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2526-8762","authenticated-orcid":false,"given":"Lutz","family":"Oettershagen","sequence":"first","affiliation":[{"name":"University of Liverpool, Liverpool, UK"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-5566-5187","authenticated-orcid":false,"given":"Athanasios L.","family":"Konstantinidis","sequence":"additional","affiliation":[{"name":"University of Ioannina, Ioannina, Greece"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9492-9894","authenticated-orcid":false,"given":"Giuseppe F.","family":"Italiano","sequence":"additional","affiliation":[{"name":"LUISS University, Rome, Italy"}]}],"member":"320","published-online":{"date-parts":[[2025,3,10]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"ISMA Works. on Int. Topol.","volume":"1","author":"Alvarez-Hamelin J Ignacio","year":"2006","unstructured":"J Ignacio Alvarez-Hamelin, Luca Dall'Asta, Alain Barrat, and Alessandro Vespignani. 2006. How the k-core decomposition helps in understanding the internet topology. In ISMA Works. on Int. Topol., Vol. 1."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.11.003"},{"key":"e_1_3_2_1_3_1","volume-title":"arXiv cs\/0310049","author":"Batagelj Vladimir","year":"2003","unstructured":"Vladimir Batagelj and Matjaz Zaversnik. 2003. An O(m) algorithm for cores decomposition of networks. arXiv cs\/0310049 (2003)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11634-010-0079-y"},{"volume-title":"Ad-Hoc, Mobile, and Wireless Networks: ADHOC-NOW2003","author":"Bhadra Sandeep","key":"e_1_3_2_1_5_1","unstructured":"Sandeep Bhadra and Afonso Ferreira. 2003. Complexity of connected components in evolving graphs and the computation of multicast trees in dynamic networks. In Ad-Hoc, Mobile, and Wireless Networks: ADHOC-NOW2003. Springer, 259--270."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3324962"},{"key":"e_1_3_2_1_7_1","volume-title":"International Symposium on Stabilizing, Safety, and Security of Distributed Systems. Springer, 3--18","author":"Casteigts Arnaud","year":"2022","unstructured":"Arnaud Casteigts, Timoth\u00e9e Corsini, and Writika Sarkar. 2022. Simple, strict, proper, happy: A study of reachability in temporal graphs. In International Symposium on Stabilizing, Safety, and Security of Distributed Systems. Springer, 3--18."},{"key":"e_1_3_2_1_8_1","volume-title":"Trusses: Cohesive subgraphs for social network analysis. National security agency technical report","author":"Cohen Jonathan","year":"2008","unstructured":"Jonathan Cohen. 2008. Trusses: Cohesive subgraphs for social network analysis. National security agency technical report, Vol. 16, 3.1 (2008), 1--29."},{"volume-title":"On Computing Large Temporal (Unilateral) Connected Components","author":"Costa Isnard Lopes","key":"e_1_3_2_1_9_1","unstructured":"Isnard Lopes Costa, Raul Lopes, Andrea Marino, and Ana Silva. 2023. On Computing Large Temporal (Unilateral) Connected Components. In IWOCA. Springer, 282--293."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.epidem.2018.04.003"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3418226"},{"key":"e_1_3_2_1_12_1","volume-title":"Time-dependent routing problems: A review. Computers & operations research","author":"Gendreau Michel","year":"2015","unstructured":"Michel Gendreau, Gianpaolo Ghiani, and Emanuela Guerriero. 2015. Time-dependent routing problems: A review. Computers & operations research, Vol. 64 (2015), 189--197."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589335.3641245"},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings of the international AAAI conference on web and social media","volume":"10","author":"Hessel Jack","year":"2016","unstructured":"Jack Hessel, Chenhao Tan, and Lillian Lee. 2016. Science, askscience, and badscience: On the coexistence of highly related communities. In Proceedings of the international AAAI conference on web and social media, Vol. 10. 171--180."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1140\/epjds5"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1140\/epjb\/e2015-60657-4"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2004.01.007"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610495"},{"key":"e_1_3_2_1_19_1","volume-title":"DASFAA Intl Workshops. Cham, 336--352","author":"Hung Wei-Chun","year":"2021","unstructured":"Wei-Chun Hung and Chih-Ying Tseng. 2021. Maximum (L,\u00a0K)-Lasting Cores in\u00a0Temporal Social Networks. In DASFAA Intl Workshops. Cham, 336--352."},{"volume-title":"The enron corpus: A new dataset for email classification research","author":"Klimt Bryan","key":"e_1_3_2_1_20_1","unstructured":"Bryan Klimt and Yiming Yang. 2004. The enron corpus: A new dataset for email classification research. In ECML. Springer, 217--226."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/16\/12\/125003"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2019.10.004"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2011\/11\/P11005"},{"key":"e_1_3_2_1_24_1","volume-title":"Jeffrey Xu Yu, and Qiangqiang Dai","author":"Li Rong-Hua","year":"2018","unstructured":"Rong-Hua Li, Jiao Su, Lu Qin, Jeffrey Xu Yu, and Qiangqiang Dai. 2018. Persistent community search in temporal networks. In ICDE. IEEE, 797--808."},{"key":"e_1_3_2_1_25_1","first-page":"1537","article-title":"Mining Diversified Top-$ r $ r Lasting Cohesive Subgraphs on Temporal Networks","volume":"8","author":"Lin Longlong","year":"2021","unstructured":"Longlong Lin, Pingpeng Yuan, Rong-Hua Li, and Hai Jin. 2021. Mining Diversified Top-$ r $ r Lasting Cohesive Subgraphs on Temporal Networks. IEEE Transactions on Big Data, Vol. 8, 6 (2021), 1537--1549.","journal-title":"IEEE Transactions on Big Data"},{"key":"e_1_3_2_1_26_1","volume-title":"Efficient Algorithms to Mine Maximal Span-Trusses From Temporal Graphs. arXiv preprint arXiv:2009.01928","author":"Lotito Quintino Francesco","year":"2020","unstructured":"Quintino Francesco Lotito and Alberto Montresor. 2020. Efficient Algorithms to Mine Maximal Span-Trusses From Temporal Graphs. arXiv preprint arXiv:2009.01928 (2020)."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00587-4"},{"key":"e_1_3_2_1_28_1","volume-title":"Contact patterns in a high school: a comparison between data collected using wearable sensors, contact diaries and friendship surveys. PloS one","author":"Mastrandrea Rossana","year":"2015","unstructured":"Rossana Mastrandrea, Julie Fournet, and Alain Barrat. 2015. Contact patterns in a high school: a comparison between data collected using wearable sensors, contact diaries and friendship surveys. PloS one, Vol. 10, 9 (2015)."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2016.1177801"},{"volume-title":"Online social networks: measurement, analysis, and applications to distributed information systems. Ph.,D. Dissertation","author":"Mislove Alan E.","key":"e_1_3_2_1_30_1","unstructured":"Alan E. Mislove. 2009. Online social networks: measurement, analysis, and applications to distributed information systems. Ph.,D. Dissertation. Rice University."},{"key":"e_1_3_2_1_31_1","volume-title":"KWIQ: Answering k-core Window Queries in Temporal Networks.","author":"Momin Mahdihusain","year":"2023","unstructured":"Mahdihusain Momin, Raj Kamal, Shantwana Dixit, Sayan Ranu, and Amitabha Bagchi. 2023. KWIQ: Answering k-core Window Queries in Temporal Networks. (2023)."},{"key":"e_1_3_2_1_32_1","volume-title":"Graph metrics for temporal networks. Temporal networks","author":"Nicosia Vincenzo","year":"2013","unstructured":"Vincenzo Nicosia, John Tang, Cecilia Mascolo, Mirco Musolesi, Giovanni Russo, and Vito Latora. 2013. Graph metrics for temporal networks. Temporal networks (2013), 15--40."},{"key":"e_1_3_2_1_33_1","volume-title":"Components in time-varying graphs. Chaos: An interdisc. journal of nonlinear science","author":"Nicosia Vincenzo","year":"2012","unstructured":"Vincenzo Nicosia, John Tang, Mirco Musolesi, Giovanni Russo, Cecilia Mascolo, and Vito Latora. 2012. Components in time-varying graphs. Chaos: An interdisc. journal of nonlinear science, Vol. 22, 2 (2012), 023101."},{"key":"e_1_3_2_1_34_1","volume-title":"Inferring Tie Strength in Temporal Networks. In Joint European Conference on Machine Learning and Knowledge Discovery in Databases. Springer, 69--85","author":"Oettershagen Lutz","year":"2022","unstructured":"Lutz Oettershagen, Athanasios L Konstantinidis, and Giuseppe F Italiano. 2022a. Inferring Tie Strength in Temporal Networks. In Joint European Conference on Machine Learning and Knowledge Discovery in Databases. Springer, 69--85."},{"key":"e_1_3_2_1_35_1","volume-title":"Italiano","author":"Oettershagen Lutz","year":"2023","unstructured":"Lutz Oettershagen, Athanasios L. Konstantinidis, and Giuseppe F. Italiano. 2023a. An Edge-Based Decomposition Framework for Temporal Networks. arxiv: 2309.11843 [cs.SI]"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","unstructured":"Lutz Oettershagen Nils M. Kriege and Petra Mutzel. 2023b. A Higher-Order Temporal H-Index for Evolving Networks. In SIGKDD. ACM 1770--1782. https:\/\/doi.org\/10.1145\/3580305.3599242","DOI":"10.1145\/3580305.3599242"},{"volume-title":"ICDM Workshops. IEEE, 1240--1245","author":"Oettershagen L.","key":"e_1_3_2_1_37_1","unstructured":"L. Oettershagen and P. Mutzel. 2022. Tglib: an open-source library for temporal graph analysis. In ICDM Workshops. IEEE, 1240--1245."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512210"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/1543767.1543769"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018731"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2020.2974849"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.14778\/3565838.3565845"},{"key":"e_1_3_2_1_43_1","volume-title":"Community discovery in dynamic networks: a survey. ACM computing surveys (CSUR)","author":"Rossetti Giulio","year":"2018","unstructured":"Giulio Rossetti and R\u00e9my Cazabet. 2018. Community discovery in dynamic networks: a survey. ACM computing surveys (CSUR), Vol. 51, 2 (2018), 1--37."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512204"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482459"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3637528.3671889"},{"key":"e_1_3_2_1_47_1","volume-title":"Network structure and minimum degree. Social networks","author":"Seidman Stephen B","year":"1983","unstructured":"Stephen B Seidman. 1983. Network structure and minimum degree. Social networks, Vol. 5, 3 (1983), 269--287."},{"key":"e_1_3_2_1_48_1","volume-title":"Anatomy of an online misinformation network. Plos one","author":"Shao Chengcheng","year":"2018","unstructured":"Chengcheng Shao, Pik-Mai Hui, Lei Wang, Xinwen Jiang, Alessandro Flammini, Filippo Menczer, and Giovanni Luca Ciampaglia. 2018. Anatomy of an online misinformation network. Plos one, Vol. 13, 4 (2018)."},{"key":"e_1_3_2_1_49_1","volume-title":"Corescope: Graph mining using k-core analysis-patterns, anomalies and algorithms","author":"Shin Kijung","year":"2016","unstructured":"Kijung Shin, Tina Eliassi-Rad, and Christos Faloutsos. 2016. Corescope: Graph mining using k-core analysis-patterns, anomalies and algorithms. In IEEE ICDM. IEEE, 469--478."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eng.2018.05.007"},{"volume-title":"Big Data","author":"Wu Huanhuan","key":"e_1_3_2_1_51_1","unstructured":"Huanhuan Wu, James Cheng, Yi Lu, Yiping Ke, Yuzhen Huang, Da Yan, and Hejun Wu. 2015. Core decomposition in large temporal graphs. In Big Data. IEEE, 649--658."},{"key":"e_1_3_2_1_52_1","volume-title":"Scalable Time-Range k-Core Query on Temporal Graphs. arXiv preprint arXiv:2301.03770","author":"Yang Junyong","year":"2023","unstructured":"Junyong Yang, Ming Zhong, Yuanyuan Zhu, Tieyun Qian, Mengchi Liu, and Jeffery Xu Yu. 2023. Scalable Time-Range k-Core Query on Temporal Graphs. arXiv preprint arXiv:2301.03770 (2023)."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476260"},{"key":"e_1_3_2_1_54_1","volume-title":"A Unified and Scalable Algorithm Framework of User-Defined Temporal $(k,mathcalX)$-Core Query","author":"Zhong Ming","year":"2024","unstructured":"Ming Zhong, Junyong Yang, Yuanyuan Zhu, Tieyun Qian, Mengchi Liu, and Jeffrey Xu Yu. 2024. A Unified and Scalable Algorithm Framework of User-Defined Temporal $(k,mathcalX)$-Core Query. IEEE Transactions on Knowledge and Data Engineering (2024)."}],"event":{"name":"WSDM '25: The Eighteenth ACM International Conference on Web Search and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Hannover Germany","acronym":"WSDM '25"},"container-title":["Proceedings of the Eighteenth ACM International Conference on Web Search and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3701551.3703556","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3701551.3703556","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T09:10:58Z","timestamp":1755767458000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3701551.3703556"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,10]]},"references-count":54,"alternative-id":["10.1145\/3701551.3703556","10.1145\/3701551"],"URL":"https:\/\/doi.org\/10.1145\/3701551.3703556","relation":{},"subject":[],"published":{"date-parts":[[2025,3,10]]},"assertion":[{"value":"2025-03-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}