{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T21:17:41Z","timestamp":1783027061115,"version":"3.54.6"},"reference-count":43,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100005047","name":"Liaoning Provincial Natural Science Foundation","doi-asserted-by":"publisher","award":["2025-BSLH-316"],"award-info":[{"award-number":["2025-BSLH-316"]}],"id":[{"id":"10.13039\/501100005047","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing & Management"],"published-print":{"date-parts":[[2027,1]]},"DOI":"10.1016\/j.ipm.2026.104965","type":"journal-article","created":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T03:57:36Z","timestamp":1781668656000},"page":"104965","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"PA","title":["Multi-connected temporal subgraph querying based on vertex index"],"prefix":"10.1016","volume":"64","author":[{"given":"Hanlin","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guangkun","family":"Ma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.ipm.2026.104965_b1","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s00778-023-00795-z","article-title":"Temporal graph patterns by timed automata","volume":"33","author":"Aghasadeghi","year":"2024","journal-title":"The VLDB Journal"},{"issue":"11","key":"10.1016\/j.ipm.2026.104965_b2","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1145\/182.358434","article-title":"Maintaining knowledge about temporal intervals","volume":"26","author":"Allen","year":"1983","journal-title":"Communications of the ACM"},{"issue":"4","key":"10.1016\/j.ipm.2026.104965_b3","first-page":"655","article-title":"Computing maximum matchings in temporal graphs","volume":"25","author":"Bump","year":"2021","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"10.1016\/j.ipm.2026.104965_b4","series-title":"Findings of the association for computational linguistics: ACL 2025","first-page":"3139","article-title":"SimGRAG: Leveraging similar subgraphs for knowledge graphs driven retrieval-augmented generation","author":"Cai","year":"2025"},{"key":"10.1016\/j.ipm.2026.104965_b5","series-title":"2024 IEEE 40th international conference on data engineering","first-page":"2972","article-title":"Large subgraph matching: a comprehensive and efficient approach for heterogeneous graphs","author":"Cao","year":"2024"},{"key":"10.1016\/j.ipm.2026.104965_b6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TKDE.2025.3557864","article-title":"Discovery of temporal network motifs","volume":"37","author":"Chen","year":"2025","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"8","key":"10.1016\/j.ipm.2026.104965_b7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3390\/ijgi10080541","article-title":"Leveraging spatio-temporal graphs and knowledge graphs: Perspectives in the field of maritime transportation","volume":"10","author":"Del Mondo","year":"2021","journal-title":"ISPRS International Journal of Geo-Information"},{"issue":"11","key":"10.1016\/j.ipm.2026.104965_b8","doi-asserted-by":"crossref","first-page":"2006","DOI":"10.14778\/3476249.3476258","article-title":"Butterfly-core community search over labeled graphs","volume":"14","author":"Dong","year":"2021","journal-title":"Proceedings of the VLDB Endowment"},{"key":"10.1016\/j.ipm.2026.104965_b9","series-title":"Proceedings of the 29th ACM SIGKDD conference on knowledge discovery and data mining","first-page":"4024","article-title":"Ilroute: A graph-based imitation learning method to unveil riders\u2019 routing strategies in food delivery service","author":"Feng","year":"2023"},{"issue":"10","key":"10.1016\/j.ipm.2026.104965_b10","doi-asserted-by":"crossref","first-page":"3453","DOI":"10.1109\/TKDE.2020.2968901","article-title":"Time-respecting flow graph pattern matching on temporal graphs","volume":"33","author":"Gao","year":"2020","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.1016\/j.ipm.2026.104965_b11","first-page":"37","article-title":"A guide to the theory of NP-completeness","author":"Garey","year":"1990","journal-title":"Computers and Intractability"},{"issue":"1","key":"10.1016\/j.ipm.2026.104965_b12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/17538947.2025.2531844","article-title":"Spatio-temporal graph data storage and calculation based on grid graph database","volume":"18","author":"Han","year":"2025","journal-title":"International Journal of Digital Earth"},{"key":"10.1016\/j.ipm.2026.104965_b13","series-title":"Proceedings of the 31st ACM SIGKDD conference on knowledge discovery and data mining v. 2","first-page":"826","article-title":"Tempasd: Temporal anomalous subgraph discovery in large-scale dynamic financial networks","author":"Han","year":"2025"},{"issue":"4","key":"10.1016\/j.ipm.2026.104965_b14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3771286","article-title":"GTSM: A multi-edge-centric temporal subgraph matching framework on GPUs","volume":"22","author":"He","year":"2025","journal-title":"ACM Transactions on Architecture and Code Optimization"},{"key":"10.1016\/j.ipm.2026.104965_b15","series-title":"2025 IEEE 41st international conference on data engineering","first-page":"4079","article-title":"OptMatch: An efficient and generic neural network-assisted subgraph matching approach","author":"Hou","year":"2025"},{"key":"10.1016\/j.ipm.2026.104965_b16","series-title":"2025 IEEE 41st international conference on data engineering","first-page":"1029","article-title":"Tematch: A fast temporal subgraph matching framework with temporal-aware subgraph matching algorithms","author":"Huan","year":"2025"},{"issue":"1","key":"10.1016\/j.ipm.2026.104965_b17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s40854-023-00548-5","article-title":"Complex network analysis of global stock market co-movement during the COVID-19 pandemic based on intraday open-high-low-close data","volume":"10","author":"Huang","year":"2024","journal-title":"Financial Innovation"},{"key":"10.1016\/j.ipm.2026.104965_b18","first-page":"1","article-title":"Large language models on graphs: A comprehensive survey","author":"Jin","year":"2024","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.1016\/j.ipm.2026.104965_b19","first-page":"1","article-title":"Probabilistic graph pattern matching via tumor knowledge graph","author":"Li","year":"2024","journal-title":"ACM Transactions on Probabilistic Machine Learning"},{"issue":"4","key":"10.1016\/j.ipm.2026.104965_b20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ipm.2025.104148","article-title":"Quality-controllable automatic construction method of Chinese knowledge graph for medical decision-making applications","volume":"62","author":"Li","year":"2025","journal-title":"Information Processing & Management"},{"key":"10.1016\/j.ipm.2026.104965_b21","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1016\/j.ins.2021.07.071","article-title":"Subgraph matching on temporal graphs","volume":"578","author":"Li","year":"2021","journal-title":"Information Sciences"},{"issue":"5","key":"10.1016\/j.ipm.2026.104965_b22","first-page":"4713","article-title":"Durable subgraph matching on temporal graphs","volume":"35","author":"Li","year":"2022","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.1016\/j.ipm.2026.104965_b23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.knosys.2022.109961","article-title":"Evolving subgraph matching on temporal graphs","volume":"258","author":"Li","year":"2022","journal-title":"Knowledge-Based Systems"},{"issue":"1","key":"10.1016\/j.ipm.2026.104965_b24","first-page":"1","article-title":"Temporalri: A subgraph isomorphism algorithm for temporal networks","volume":"6","author":"Locicero","year":"2021","journal-title":"Applied Network Science"},{"issue":"6","key":"10.1016\/j.ipm.2026.104965_b25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ipm.2024.103848","article-title":"Taret: Temporal knowledge graph reasoning based on topology-aware dynamic relation graph and temporal fusion","volume":"61","author":"Ma","year":"2024","journal-title":"Information Processing & Management"},{"issue":"2","key":"10.1016\/j.ipm.2026.104965_b26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ipm.2023.103605","article-title":"Multi-hop path reasoning over sparse temporal knowledge graphs based on path completion and reward shaping","volume":"61","author":"Meng","year":"2024","journal-title":"Information Processing & Management"},{"key":"10.1016\/j.ipm.2026.104965_b27","series-title":"2024 IEEE 40th international conference on data engineering","first-page":"3257","article-title":"Time-constrained continuous subgraph matching using temporal information for filtering and backtracking","author":"Min","year":"2024"},{"issue":"3","key":"10.1016\/j.ipm.2026.104965_b28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ipm.2024.104045","article-title":"Pagellm: Incremental approach for updating a security knowledge graph by using page ranking and large language model","volume":"62","author":"Mishra","year":"2025","journal-title":"Information Processing & Management"},{"key":"10.1016\/j.ipm.2026.104965_b29","series-title":"2025 IEEE 41st international conference on data engineering","first-page":"1180","article-title":"Pilos: Scalable large-subgraph matching by online spectral filtering","author":"Skitsas","year":"2025"},{"issue":"5","key":"10.1016\/j.ipm.2026.104965_b30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ipm.2025.104145","article-title":"Knowledge graph validation by integrating LLMs and human-in-the-loop","volume":"62","author":"Tsaneva","year":"2025","journal-title":"Information Processing & Management"},{"key":"10.1016\/j.ipm.2026.104965_b31","first-page":"1","article-title":"Enhancing attribute-driven fraud detection with risk-aware graph representation","author":"Xiang","year":"2025","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.1016\/j.ipm.2026.104965_b32","series-title":"Web and big data: first international joint conference, aPWeb-WAIM 2017, Beijing, China, July 7\u20139, 2017, proceedings, part i 1","first-page":"100","article-title":"Time-constrained graph pattern matching in a large temporal graph","author":"Xu","year":"2017"},{"issue":"3","key":"10.1016\/j.ipm.2026.104965_b33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ipm.2024.104047","article-title":"Historical facts learning from long-short terms with language model for temporal knowledge graph reasoning","volume":"62","author":"Xu","year":"2025","journal-title":"Information Processing & Management"},{"issue":"5","key":"10.1016\/j.ipm.2026.104965_b34","doi-asserted-by":"crossref","first-page":"1168","DOI":"10.14778\/3579075.3579089","article-title":"Scalable time-range k-core query on temporal graphs","volume":"16","author":"Yang","year":"2023","journal-title":"Proceedings of the VLDB Endowment"},{"key":"10.1016\/j.ipm.2026.104965_b35","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ins.2024.121320","article-title":"Temporal subgraph matching method for multi-connected temporal graph","volume":"686","author":"Zhang","year":"2025","journal-title":"Information Sciences"},{"issue":"3","key":"10.1016\/j.ipm.2026.104965_b36","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11280-024-01259-2","article-title":"Towards efficient simulation-based constrained temporal graph pattern matching","volume":"27","author":"Zhang","year":"2024","journal-title":"World Wide Web"},{"issue":"6","key":"10.1016\/j.ipm.2026.104965_b37","first-page":"6405","article-title":"Stable subgraph isomorphism search in temporal networks","volume":"35","author":"Zhang","year":"2022","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.1016\/j.ipm.2026.104965_b38","series-title":"Proceedings of the 30th ACM SIGKDD conference on knowledge discovery and data mining","first-page":"4350","article-title":"LLM4dyg: can large language models solve spatial-temporal problems on dynamic graphs?","author":"Zhang","year":"2024"},{"key":"10.1016\/j.ipm.2026.104965_b39","series-title":"Proceedings of the 2023 ACM international conference on management of data","first-page":"2992","article-title":"Fast continuous subgraph matching over streaming graphs via backtracking reduction","author":"Zhao","year":"2023"},{"issue":"8","key":"10.1016\/j.ipm.2026.104965_b40","doi-asserted-by":"crossref","first-page":"9281","DOI":"10.1109\/TITS.2024.3374281","article-title":"Graph matching-based spatiotemporal calibration of roadside sensors in cooperative vehicle-infrastructure systems","volume":"25","author":"Zhao","year":"2024","journal-title":"IEEE Transactions on Intelligent Transportation Systems"},{"key":"10.1016\/j.ipm.2026.104965_b41","series-title":"2017 IEEE 11th international conference on semantic computing","first-page":"156","article-title":"Querying intimate-core groups in weighted graphs","author":"Zheng","year":"2017"},{"key":"10.1016\/j.ipm.2026.104965_b42","series-title":"2021 IEEE 37th international conference on data engineering","first-page":"672","article-title":"Leveraging temporal and topological selectivities in temporal-clique subgraph query processing","author":"Zhu","year":"2021"},{"key":"10.1016\/j.ipm.2026.104965_b43","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.knosys.2023.111301","article-title":"Hierarchical pattern-based complex query of temporal knowledge graph","volume":"284","author":"Zhu","year":"2024","journal-title":"Knowledge-Based Systems"}],"container-title":["Information Processing & Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306457326003560?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306457326003560?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T20:30:45Z","timestamp":1783024245000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0306457326003560"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2027,1]]},"references-count":43,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2027,1]]}},"alternative-id":["S0306457326003560"],"URL":"https:\/\/doi.org\/10.1016\/j.ipm.2026.104965","relation":{},"ISSN":["0306-4573"],"issn-type":[{"value":"0306-4573","type":"print"}],"subject":[],"published":{"date-parts":[[2027,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Multi-connected temporal subgraph querying based on vertex index","name":"articletitle","label":"Article Title"},{"value":"Information Processing & Management","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ipm.2026.104965","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"104965"}}