{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T07:15:57Z","timestamp":1783667757034,"version":"3.55.0"},"reference-count":71,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"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":["The VLDB Journal"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1007\/s00778-026-00989-1","type":"journal-article","created":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T11:05:51Z","timestamp":1782903951000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On querying minimum spanning tree in temporal graphs"],"prefix":"10.1007","volume":"35","author":[{"given":"Yuanhang","family":"Yu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dong","family":"Wen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lu","family":"Qin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dawei","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,1]]},"reference":[{"issue":"3","key":"989_CR1","first-page":"9","volume":"5","author":"NP Akpan","year":"2017","unstructured":"Akpan, N.P., Iwok, I.A.: A minimum spanning tree approach of solving a transportation problem. International Journal of Mathematics and Statistics Invention (IJMSI) 5(3), 9\u201318 (2017)","journal-title":"International Journal of Mathematics and Statistics Invention (IJMSI)"},{"key":"989_CR2","doi-asserted-by":"crossref","unstructured":"Awerbuch, B.: Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems. In Proceedings of the nineteenth annual ACM symposium on Theory of computing, pages 230\u2013240, (1987)","DOI":"10.1145\/28395.28421"},{"key":"989_CR3","first-page":"523","volume":"2023","author":"Q Bai","year":"2023","unstructured":"Bai, Q., Nie, C., Zhang, H., Zhao, D., Yuan, X.: Hgwavenet: A hyperbolic graph neural network for temporal link prediction. In Proceedings of the ACM Web Conference 2023, 523\u2013532 (2023)","journal-title":"In Proceedings of the ACM Web Conference"},{"key":"989_CR4","unstructured":"Bock, F.: An algorithm to construct a minimum directed spanning tree in a directed network. Developments in operations research, pages 29\u201344, (1971)"},{"key":"989_CR5","unstructured":"Bor\u00fcvka, O.: O jist\u00e9m probl\u00e9mu minim\u00e1ln\u00edm, (1926)"},{"key":"989_CR6","doi-asserted-by":"crossref","unstructured":"Paolo, M., Camerini, L., Maffioli, F.F.: A note on finding optimum branchings. Networks 9(4), 309\u2013312 (1979)","DOI":"10.1002\/net.3230090403"},{"key":"989_CR7","doi-asserted-by":"crossref","unstructured":"Paolo, M., Camerini, L., Maffioli, F.F.: The k best spanning arborescences of a network. Networks 10(2), 91\u2013109 (1980)","DOI":"10.1002\/net.3230100202"},{"key":"989_CR8","doi-asserted-by":"crossref","unstructured":"Chanthaphan, A., Prom-on, S., Meechai, A., Chan, J.: Identifying functional modules using mst-based weighted gene co-expression networks. In 2009 Ninth IEEE International Conference on Bioinformatics and BioEngineering, pages 192\u2013199 (2009)","DOI":"10.1109\/BIBE.2009.35"},{"key":"989_CR9","doi-asserted-by":"crossref","unstructured":"Chin, F., Ting, H.F.: An almost linear time and o (nlogn+ e) messages distributed algorithm for minimum-weight spanning trees. In 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), pages 257\u2013266. IEEE, (1985)","DOI":"10.1109\/SFCS.1985.7"},{"key":"989_CR10","first-page":"310","volume":"206","author":"G Choquet","year":"1938","unstructured":"Choquet, G.: \u00c9tude de certains r\u00e9seaux de routes. C. R. Hebd. Seances Acad. Sci. 206, 310\u2013313 (1938)","journal-title":"C. R. Hebd. Seances Acad. Sci."},{"key":"989_CR11","first-page":"1396","volume":"14","author":"Y-J Chu","year":"1965","unstructured":"Chu, Y.-J.: On the shortest arborescence of a directed graph. Sci. Sinica 14, 1396\u20131400 (1965)","journal-title":"Sci. Sinica"},{"key":"989_CR12","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms, MIT press (2022)"},{"key":"989_CR13","doi-asserted-by":"publisher","first-page":"1458339","DOI":"10.3389\/fpsyg.2024.1458339","volume":"15","author":"Y Dai","year":"2024","unstructured":"Dai, Y., He, Q., Wang, S., Cao, T., Chai, X., Wang, N., Dong, Y., Wong, P., He, J., Duan, F., et al.: Deciphering network dysregulations and temporo-spatial dynamics in disorders of consciousness: insights from minimum spanning tree analysis. Front. Psychol. 15, 1458339 (2024)","journal-title":"Front. Psychol."},{"key":"989_CR14","doi-asserted-by":"crossref","unstructured":"Das\u00a0Sarma, A., Holzer, S., Kor, L., Korman, A., Nanongkai, D., Pandurangan, G., Peleg, D., Wattenhofer, R.: Distributed verification and hardness of distributed approximation. In Proceedings of the forty-third annual ACM symposium on Theory of computing, pages 363\u2013372, (2011)","DOI":"10.1145\/1993636.1993686"},{"key":"989_CR15","doi-asserted-by":"crossref","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. In Edsger Wybe Dijkstra: His Life, Work, and Legacy, pages 287\u2013290. (2022)","DOI":"10.1145\/3544585.3544600"},{"issue":"4","key":"989_CR16","doi-asserted-by":"publisher","first-page":"233","DOI":"10.6028\/jres.071B.032","volume":"71","author":"J Edmonds","year":"1967","unstructured":"Edmonds, J., et al.: Optimum branchings. Journal of Research of the national Bureau of Standards B 71(4), 233\u2013240 (1967)","journal-title":"Journal of Research of the national Bureau of Standards B"},{"issue":"1","key":"989_CR17","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s00446-021-00398-3","volume":"36","author":"O Fischer","year":"2023","unstructured":"Fischer, O., Oshman, R.: A distributed algorithm for directed minimum-weight spanning tree. Distrib. Comput. 36(1), 57\u201387 (2023)","journal-title":"Distrib. Comput."},{"key":"989_CR18","doi-asserted-by":"publisher","first-page":"282","DOI":"10.4064\/cm-2-3-4-282-285","volume":"2","author":"K Florek","year":"1951","unstructured":"Florek, K., \u0141ukaszewicz, J., Perkal, J., Steinhaus, H., Zubrzycki, S.: Sur la liaison et la division des points d\u2019un ensemble fini. In Colloquium mathematicum 2, 282\u2013285 (1951)","journal-title":"In Colloquium mathematicum"},{"key":"989_CR19","doi-asserted-by":"crossref","unstructured":"Frederickson, G.N.: Data structures for on-line updating of minimum spanning trees. In Proceedings of the fifteenth annual ACM symposium on Theory of computing, pages 252\u2013257, (1983)","DOI":"10.1145\/800061.808754"},{"key":"989_CR20","doi-asserted-by":"crossref","unstructured":"Gabow, H.N., Galil, Z., Spencer, T., Tarja, R.E.: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Combinatorica 6(2), 109\u2013122 (1986)","DOI":"10.1007\/BF02579168"},{"key":"989_CR21","doi-asserted-by":"crossref","unstructured":"Gafni, E.: Improvements in the time complexity of two message-optimal election algorithms. In Proceedings of the fourth annual ACM symposium on Principles of distributed computing, pages 175\u2013185, (1985)","DOI":"10.1145\/323596.323612"},{"issue":"1","key":"989_CR22","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/357195.357200","volume":"5","author":"RG Gallager","year":"1983","unstructured":"Gallager, R.G., Humblet, P.A., Spira, P.M.: A distributed algorithm for minimum-weight spanning trees. ACM Transactions on Programming Languages and systems (TOPLAS) 5(1), 66\u201377 (1983)","journal-title":"ACM Transactions on Programming Languages and systems (TOPLAS)"},{"key":"989_CR23","doi-asserted-by":"crossref","unstructured":"Juan, A., Garay, S., Peleg, K.D.: A sublinear time distributed algorithm for minimum-weight spanning trees. SIAM J. Comput. 27(1), 302\u2013316 (1998)","DOI":"10.1137\/S0097539794261118"},{"key":"989_CR24","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.apenergy.2014.06.064","volume":"132","author":"J-B Geng","year":"2014","unstructured":"Geng, J.-B., Ji, Q., Fan, Y.: A dynamic analysis on global natural gas trade network. Appl. Energy 132, 23\u201333 (2014)","journal-title":"Appl. Energy"},{"key":"989_CR25","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Kuhn, F., Su, H.-H.: Distributed mst and routing in almost mixing time. In Proceedings of the ACM Symposium on Principles of Distributed Computing, pages 131\u2013140, (2017)","DOI":"10.1145\/3087801.3087827"},{"key":"989_CR26","doi-asserted-by":"crossref","unstructured":"Michael, T., Tamassia, G.R.: Dynamic trees and dynamic point location. SIAM J. Comput. 28(2), 612\u2013636 (1998)","DOI":"10.1137\/S0097539793254376"},{"key":"989_CR27","doi-asserted-by":"crossref","unstructured":"Monika, R., King, H.V.: Randomized fully dynamic graph algorithms with polylogarithmic time per operation. Journal of the ACM (JACM) 46(4), 502\u2013516 (1999)","DOI":"10.1145\/320211.320215"},{"issue":"4","key":"989_CR28","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1145\/502090.502095","volume":"48","author":"J Holm","year":"2001","unstructured":"Holm, J., De Lichtenberg, K., Thorup, M.: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. Journal of the ACM (JACM) 48(4), 723\u2013760 (2001)","journal-title":"Journal of the ACM (JACM)"},{"key":"989_CR29","doi-asserted-by":"crossref","unstructured":"Huang, S., Wai-Chee Fu, A., Liu, R.: Minimum spanning trees in temporal graphs. In Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pages 419\u2013430, (2015)","DOI":"10.1145\/2723372.2723717"},{"key":"989_CR30","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.chaos.2016.11.007","volume":"94","author":"W-Q Huang","year":"2017","unstructured":"Huang, W.-Q., Yao, S., Zhuang, X.-T., Yuan, Y.: Dynamic asset trees in the us stock market: Structure variation and market phenomena. Chaos, Solitons & Fractals 94, 44\u201353 (2017)","journal-title":"Chaos, Solitons & Fractals"},{"key":"989_CR31","unstructured":"Jarn\u00edk, V.: O jist\u00e9m probl\u00e9mu minim\u00e1ln\u00edm.(z dopisu panu o. bor\u00eduvkovi). 1930"},{"key":"989_CR32","doi-asserted-by":"crossref","unstructured":"Karger, D.R., Klein, P.N., Tarjan, R.E.: A randomized linear-time algorithm to find minimum spanning trees. Journal of the ACM (JACM) 42(2), 321\u2013328 (1995)","DOI":"10.1145\/201019.201022"},{"key":"989_CR33","doi-asserted-by":"crossref","unstructured":"Kolodziej, S.P., Aznaveh, M., Bullock, M., David, J., Davis, T.\u00a0A., Henderson, M., Hu, Y., Sandstrom, R.: The suitesparse matrix collection website interface. Journal of Open Source Software, 4(35):1244, (2019)","DOI":"10.21105\/joss.01244"},{"key":"989_CR34","doi-asserted-by":"publisher","first-page":"8617","DOI":"10.1609\/aaai.v38i8.28706","volume":"38","author":"D Kong","year":"2024","unstructured":"Kong, D., Zhang, A., Li, Y.: Learning persistent community structures in dynamic networks via topological data analysis. In Proceedings of the AAAI Conference on Artificial Intelligence 38, 8617\u20138626 (2024)","journal-title":"In Proceedings of the AAAI Conference on Artificial Intelligence"},{"key":"989_CR35","doi-asserted-by":"crossref","unstructured":"Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical society 7(1), 48\u201350 (1956)","DOI":"10.1090\/S0002-9939-1956-0078686-7"},{"key":"989_CR36","doi-asserted-by":"crossref","unstructured":"Konect, K.J.: the koblenz network collection. In Proceedings of the 22nd international conference on world wide web, pages 1343\u20131350, (2013)","DOI":"10.1145\/2487788.2488173"},{"key":"989_CR37","doi-asserted-by":"crossref","unstructured":"Kutten, S., Peleg, D.: Fast distributed construction of k-dominating sets and applications. In Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing, pages 238\u2013251, (1995)","DOI":"10.1145\/224964.224990"},{"issue":"1","key":"989_CR38","first-page":"1","volume":"8","author":"J Leskovec","year":"2016","unstructured":"Leskovec, J., Sosi\u010d, R.: Snap: A general-purpose network analysis and graph-mining library. ACM Transactions on Intelligent Systems and Technology (TIST) 8(1), 1\u201320 (2016)","journal-title":"ACM Transactions on Intelligent Systems and Technology (TIST)"},{"key":"989_CR39","first-page":"1342","volume":"2025","author":"D Li","year":"2025","unstructured":"Li, D., Kosugi, S., Zhang, Y., Okumura, M., Xia, F., Jiang, R.: Revisiting dynamic graph clustering via matrix factorization. In Proceedings of the ACM on Web Conference 2025, 1342\u20131352 (2025)","journal-title":"In Proceedings of the ACM on Web Conference"},{"key":"989_CR40","doi-asserted-by":"crossref","unstructured":"Liu, M., Liang, K., Yu, H., Meng, L., Wang, S., Zhou, S., Liu, X.: Multiview temporal graph clustering. IEEE Transactions on Neural Networks and Learning Systems, (2025)","DOI":"10.1109\/TNNLS.2025.3584384"},{"issue":"1","key":"989_CR41","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s41109-019-0248-7","volume":"5","author":"Z Liu","year":"2020","unstructured":"Liu, Z., Barahona, M.: Graph-based data clustering via multiscale community detection. Applied Network Science 5(1), 3 (2020)","journal-title":"Applied Network Science"},{"key":"989_CR42","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L.: Computing ears and branchings in parallel. In 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), pages 464\u2013467. IEEE, (1985)","DOI":"10.1109\/SFCS.1985.16"},{"key":"989_CR43","doi-asserted-by":"crossref","unstructured":"Mantegna, R.N.: Hierarchical structure in financial markets. The European Physical Journal B-Condensed Matter and Complex Systems 11(1), 193\u2013197 (1999)","DOI":"10.1007\/s100510050929"},{"key":"989_CR44","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2020.125605","volume":"566","author":"T Millington","year":"2021","unstructured":"Millington, T., Niranjan, M.: Construction of minimum spanning trees from financial returns using rank correlation. Physica A 566, 125605 (2021)","journal-title":"Physica A"},{"key":"989_CR45","doi-asserted-by":"crossref","unstructured":"Onnela, J.-P., Chakraborti, A., Kaski, K., Kertesz, J., Kanto, A.: Dynamics of market correlations: Taxonomy and portfolio analysis. Physical Review E, 68(5):056110, (2003)","DOI":"10.1103\/PhysRevE.68.056110"},{"key":"989_CR46","doi-asserted-by":"crossref","unstructured":"Pandurangan, G., Robinson, P., Scquizzato, M.: A time-and message-optimal distributed algorithm for minimum spanning trees. In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pages 743\u2013756, (2017)","DOI":"10.1145\/3055399.3055449"},{"issue":"1","key":"989_CR47","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3209689","volume":"5","author":"G Pandurangan","year":"2018","unstructured":"Pandurangan, G., Robinson, P., Scquizzato, M.: Fast distributed algorithms for connectivity and mst in large graphs. ACM Transactions on Parallel Computing (TOPC) 5(1), 1\u201322 (2018)","journal-title":"ACM Transactions on Parallel Computing (TOPC)"},{"key":"989_CR48","first-page":"1115","volume":"2022","author":"Contrastive graph clustering forcommunity detection and tracking","year":"2022","unstructured":"Contrastive graph clustering forcommunity detection and tracking: Namyong Park, Ryan Rossi, Eunyee Koh, Iftikhar Ahamath Burhanuddin, Sungchul Kim, Fan Du, Nesreen Ahmed, and Christos Faloutsos. Cgc. In Proceedings of the ACM Web Conference 2022, 1115\u20131126 (2022)","journal-title":"In Proceedings of the ACM Web Conference"},{"key":"989_CR49","doi-asserted-by":"crossref","unstructured":"Poursafaei, F., Zilic, Z., Rabbany, R.: A strong node classification baseline for temporal graphs. In Proceedings of the 2022 SIAM International Conference on Data Mining (SDM), pages 648\u2013656. SIAM, (2022)","DOI":"10.1137\/1.9781611977172.73"},{"issue":"6","key":"989_CR50","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"Robert Clay Prim","year":"1957","unstructured":"Robert Clay Prim: Shortest connection networks and some generalizations. The Bell System Technical Journal 36(6), 1389\u20131401 (1957)","journal-title":"The Bell System Technical Journal"},{"key":"989_CR51","doi-asserted-by":"crossref","unstructured":"Rossi, R., Ahmed, N.: The network data repository with interactive graph analytics and visualization. In Proceedings of the AAAI conference on artificial intelligence, volume\u00a029, (2015)","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"989_CR52","doi-asserted-by":"crossref","unstructured":"Sankar, A., Wu, Y., Gou, L., Zhang, W., Yang, H.: Dysat: Deep neural representation learning on dynamic graphs via self-attention networks. In Proceedings of the 13th international conference on web search and data mining, pages 519\u2013527, (2020)","DOI":"10.1145\/3336191.3371845"},{"key":"989_CR53","doi-asserted-by":"crossref","unstructured":"Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. In Proceedings of the thirteenth annual ACM symposium on Theory of computing, pages 114\u2013122, (1981)","DOI":"10.1145\/800076.802464"},{"key":"989_CR54","volume-title":"Le trace de canalisation","author":"M Sollin","year":"1965","unstructured":"Sollin, M.: Le trace de canalisation. Games, and Transportation Networks, Programming (1965)"},{"issue":"3","key":"989_CR55","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3654960","volume":"2","author":"J Song","year":"2024","unstructured":"Song, J., Wen, D., Lantian, X., Qin, L., Zhang, W., Lin, X.: On querying historical connectivity in temporal graphs. Proceedings of the ACM on Management of Data 2(3), 1\u201325 (2024)","journal-title":"Proceedings of the ACM on Management of Data"},{"issue":"3","key":"989_CR56","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.ijpsycho.2014.04.001","volume":"92","author":"CJ Stam","year":"2014","unstructured":"Stam, C.J., Tewarie, P., Van Dellen, E., Van Straaten, E.C.W., Hillebrand, A., Van Mieghem, P.: The trees and the forest: characterization of complex brain networks with minimum spanning trees. Int. J. Psychophysiol. 92(3), 129\u2013138 (2014)","journal-title":"Int. J. Psychophysiol."},{"key":"989_CR57","doi-asserted-by":"crossref","unstructured":"Sun, J., Gu, M., Yeh, C.-C.M., Fan, Y., Chowdhary, G., Zhang, W.: Dynamic graph node classification via time augmentation. In 2022 IEEE International Conference on Big Data (Big Data), pages 800\u2013805. IEEE, (2022)","DOI":"10.1109\/BigData55660.2022.10020941"},{"key":"989_CR58","first-page":"1","volume":"15","author":"Anas Abu Taleb","year":"2023","unstructured":"Anas Abu Taleb: Using minimum connected dominating set for mobile sink path planning in wireless sensor networks. International Journal of Communication Networks and Information Security 15, 1\u20138 (2023)","journal-title":"International Journal of Communication Networks and Information Security"},{"key":"989_CR59","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.neuroimage.2014.10.015","volume":"104","author":"an unbiased method for brain network analysis","year":"2015","unstructured":"an unbiased method for brain network analysis: Prejaas Tewarie, Edwin van Dellen, Arjan Hillebrand, and Cornelis J Stam. The minimum spanning tree. Neuroimage 104, 177\u2013188 (2015)","journal-title":"Neuroimage"},{"key":"989_CR60","doi-asserted-by":"crossref","unstructured":"Thorup, M.: Worst-case update times for fully-dynamic all-pairs shortest paths. In Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, pages 112\u2013119, (2005)","DOI":"10.1145\/1060590.1060607"},{"key":"989_CR61","doi-asserted-by":"crossref","unstructured":"Voloch, N., Gudes, E.: An mst-based information flow model for security in online social networks. In 2019 Eleventh International Conference on Ubiquitous and Future Networks (ICUFN), pages 460\u2013465. IEEE, (2019)","DOI":"10.1109\/ICUFN.2019.8806160"},{"issue":"6","key":"989_CR62","doi-asserted-by":"publisher","first-page":"1609","DOI":"10.1007\/s11571-022-09907-x","volume":"17","author":"H Wang","year":"2023","unstructured":"Wang, H., Zhu, R., Tian, S., Shao, J., Dai, Z., Xue, L., Sun, Y., Chen, Z., Yao, Z., Qing, L.: Classification of bipolar disorders using the multilayer modularity in dynamic minimum spanning tree from resting state fmri. Cogn. Neurodyn. 17(6), 1609\u20131619 (2023)","journal-title":"Cogn. Neurodyn."},{"key":"989_CR63","doi-asserted-by":"crossref","unstructured":"Wang, Z., Hou, M., Yuan, G., He, J., Cui, J., Zhu, M.: Hierarchical community detection in social networks based on micro-community and minimum spanning tree. IEICE Trans. Inf. Syst. 102(9), 1773\u20131783 (2019)","DOI":"10.1587\/transinf.2018EDP7205"},{"issue":"2","key":"989_CR64","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3589315","volume":"1","author":"H Xie","year":"2023","unstructured":"Xie, H., Fang, Y., Xia, Y., Luo, W., Ma, C.: On querying connected components in large temporal graphs. Proceedings of the ACM on Management of Data 1(2), 1\u201327 (2023)","journal-title":"Proceedings of the ACM on Management of Data"},{"issue":"1","key":"989_CR65","first-page":"1","volume":"3","author":"X Lantian","year":"2025","unstructured":"Lantian, X., Dong Wen, L., Qin, R.L., Zhang, Y., Yang, L., Lin, X.: Minimum spanning tree maintenance in dynamic graphs. Proceedings of the ACM on Management of Data 3(1), 1\u201324 (2025)","journal-title":"Proceedings of the ACM on Management of Data"},{"key":"989_CR66","doi-asserted-by":"crossref","unstructured":"Yang, J., Zhong, M., Zhu, Y., Qian, T., Liu, M., Yu, J.X.: Scalable time-range k-core query on temporal graphs. Proceedings of the VLDB Endowment, 16(5):1168\u20131180, (2023)","DOI":"10.14778\/3579075.3579089"},{"key":"989_CR67","doi-asserted-by":"crossref","unstructured":"You, J., Hu, C., Kamigaito, H., Funakoshi, K., Okumura, M.: Robust dynamic clustering for temporal networks. In Proceedings of the 30th ACM International Conference on Information & Knowledge Management, pages 2424\u20132433, (2021)","DOI":"10.1145\/3459637.3482473"},{"key":"989_CR68","doi-asserted-by":"crossref","unstructured":"Yu, M., Wen, D., Qin, L., Zhang, Y., Zhang, W., Lin, X.: On querying historical k-cores. Proceedings of the VLDB Endowment, (2021)","DOI":"10.14778\/3476249.3476260"},{"issue":"2","key":"989_CR69","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/s00778-025-00903-1","volume":"34","author":"Yu Yuanhang","year":"2025","unstructured":"Yuanhang, Yu., Wen, D., Michael, Yu., Qin, L., Zhang, Y., Zhang, W., Lin, X.: Querying historical k-cores in large temporal graphs. VLDB J. 34(2), 26 (2025)","journal-title":"VLDB J."},{"key":"989_CR70","first-page":"1505","volume":"2025","author":"C Yue","year":"2025","unstructured":"Yue, C., Lun, D., Chen, M.: Heterogeneous temporal graph neural networks for link prediction. In Companion Proceedings of the ACM on Web Conference 2025, 1505\u20131509 (2025)","journal-title":"In Companion Proceedings of the ACM on Web Conference"},{"key":"989_CR71","doi-asserted-by":"crossref","unstructured":"Zhu, J., Wu, X., Yu, L., Zhang, X.: A hybrid clustering and boosting tree feature selection (cbtfs) method for credit risk assessment with high-dimensionality. Technological and Economic Development of Economy, pages 1\u201333, (2025)","DOI":"10.3846\/tede.2025.23060"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-026-00989-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-026-00989-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-026-00989-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T06:42:40Z","timestamp":1783665760000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-026-00989-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":71,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2026,7]]}},"alternative-id":["989"],"URL":"https:\/\/doi.org\/10.1007\/s00778-026-00989-1","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"13 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 May 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 July 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"35"}}