{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T13:48:34Z","timestamp":1751982514342,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"27","license":[{"start":{"date-parts":[[2024,2,3]],"date-time":"2024-02-03T00:00:00Z","timestamp":1706918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,3]],"date-time":"2024-02-03T00:00:00Z","timestamp":1706918400000},"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":["Multimed Tools Appl"],"DOI":"10.1007\/s11042-024-18328-3","type":"journal-article","created":{"date-parts":[[2024,2,3]],"date-time":"2024-02-03T07:02:22Z","timestamp":1706943742000},"page":"69875-69896","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Tps: A new way to find good vertex-search order for exact subgraph matching"],"prefix":"10.1007","volume":"83","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-4552-1389","authenticated-orcid":false,"given":"Yixing","family":"Ma","sequence":"first","affiliation":[]},{"given":"Baomin","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Hongfeng","family":"Yin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,3]]},"reference":[{"issue":"3\u20134","key":"18328_CR1","first-page":"11","volume":"23","author":"F Gandon","year":"2018","unstructured":"Gandon F (2018) A survey of the first 20 years of research on semantic Web and linked data. Ingenierie des Systemes d\u2019Information 23(3\u20134):11\u201356","journal-title":"Ingenierie des Systemes d'Information"},{"key":"18328_CR2","unstructured":"Xin H , Xuejun C (2012) A Visualize Method for Protein-Protein Interaction Network Based on Extended Clique. Bulletin of Science and Technology"},{"issue":"5","key":"18328_CR3","doi-asserted-by":"publisher","first-page":"e97896","DOI":"10.1371\/journal.pone.0097896","volume":"9","author":"Maarten Houbraken","year":"2013","unstructured":"Houbraken Maarten et al (2013) The Index-Based Subgraph Matching Algorithm with General Symmetries (ISMAGS): Exploiting Symmetry for Faster Subgraph Enumeration. Plos One 9(5):e97896\u2013e97896","journal-title":"Plos One"},{"key":"18328_CR4","unstructured":"Xu, Xiang, Wang, Xiaofang, Kitani, Kris M. (2018) Error Correction Maximization for Deep Image Hashing. British Machine Vision Conference (BMVC)"},{"issue":"1","key":"18328_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TVCG.2007.70405","volume":"14","author":"DS Coming","year":"2008","unstructured":"Coming DS, Staadt OG (2008) Velocity-Aligned Discrete Oriented Polytopes for Dynamic Collision Detection. IEEE Trans Visualization and Computer Graphics 14(1):1\u201312. https:\/\/doi.org\/10.1109\/TVCG.2007.70405","journal-title":"IEEE Trans Visualization and Computer Graphics"},{"key":"18328_CR6","doi-asserted-by":"crossref","unstructured":"Wickramaarachchi, Charith, et al. (2016) Distributed Exact Subgraph Matching in Small Diameter Dynamic Graphs. IEEE International Conference on Big Data","DOI":"10.1109\/BigData.2016.7840996"},{"key":"18328_CR7","doi-asserted-by":"publisher","unstructured":"H. Goto, Y. Hasegawa, and M. Tanaka. (2007) Efficient Scheduling Focusing on the Duality of MPL Representation. Proc. IEEE Symp. Computational Intelligence in Scheduling 57\u201364. https:\/\/doi.org\/10.1109\/SCIS.2007.367670","DOI":"10.1109\/SCIS.2007.367670"},{"key":"18328_CR8","unstructured":"Xiang Xu, Megha Nawhal, Greg Mori, Manolis Savva.MCMI: (2007) Multi-Cycle Image Translation with Mutual Information Constraints. https:\/\/arxiv.org\/abs\/ 2007.02919"},{"key":"18328_CR9","unstructured":"Kush, Deepanshu; Rossman, Benjamin. Tree-depth and the Formula Complexity of Subgraph Isomorphism. https:\/\/arxiv.org\/abs\/2004.13302"},{"key":"18328_CR10","doi-asserted-by":"crossref","unstructured":"Cibej, Uros, Mihelic, et al. (2015) Improvements to Ullmann's Algorithm for the Subgraph Isomorphism Problem. International Journal of Pattern Recognition & Artificial Intelligence","DOI":"10.1142\/S0218001415500251"},{"key":"18328_CR11","unstructured":"J. Ingraham, V. Garg, R. Barzilay, T. Jaakkola. (2019) Generative Models for Graph-based Protein Design. In Neural Information Processing Systems (NeurIPS)"},{"key":"18328_CR12","doi-asserted-by":"publisher","unstructured":"J.M.P. Martinez, R.B. Llavori, M.J.A. Cabo, and T.B. Pedersen. (2007) Integrating Data Warehouses with Web Data: A Survey. IEEE Trans. Knowledge and Data Eng., preprint, 21 https:\/\/doi.org\/10.1109\/TKDE.2007.190746","DOI":"10.1109\/TKDE.2007.190746"},{"key":"18328_CR13","doi-asserted-by":"crossref","unstructured":"Kim, H., Choi, Y., Park, K., Lin, X., Hong, S. H., Han, W. S. (2021). Versatile equivalences: Speeding up subgraph query processing and subgraph matching. In Proceedings of the 2021 International Conference on Management of Data (pp. 925\u2013937)","DOI":"10.1145\/3448016.3457265"},{"issue":"suppl 1","key":"18328_CR14","doi-asserted-by":"publisher","first-page":"i302","DOI":"10.1093\/bioinformatics\/bti1054","volume":"21","author":"E Nabieva","year":"2005","unstructured":"Nabieva E, Jim K, Agarwal A et al (2005) Whole-proteome Prediction of Protein Function Via Graph-theoretic Analysis of Interaction Maps. Bioinformatics 21(suppl 1):i302\u2013i310","journal-title":"Bioinformatics"},{"key":"18328_CR15","doi-asserted-by":"crossref","unstructured":"Lyu X , Wang X , Li Y F , et al. (2015) GraSS: An Efficient Method for RDF Subgraph Matching. International Conference on Web Information Systems Engineering. Springer, Cham","DOI":"10.1007\/978-3-319-26190-4_8"},{"key":"18328_CR16","doi-asserted-by":"crossref","unstructured":"Baomin Xu, Tinglin Xin, Yunfeng Wang, Yanpin Zhao. (2013) Local Random Walk with Distance Measure. Modern Physics Letters B.27(8) 1\u20139","DOI":"10.1142\/S0217984913500553"},{"key":"18328_CR17","doi-asserted-by":"crossref","unstructured":"J. Cheng, Y. Ke, W. Ng, A. Lu. (2007) Fg-index: Towards Verification-free Query Processing on Graph Databases. In Proceedings of the ACM SIGMOD international conference on Management of data, pages 857\u2013872","DOI":"10.1145\/1247480.1247574"},{"key":"18328_CR18","doi-asserted-by":"crossref","unstructured":"Khan, Arijit, Nan Li, Xifeng Yan, Ziyu Guan, Supriyo Chakraborty, Shu Tao. (2011) Neighborhood Based Fast Graph Search in Large Networks. In\u00a0Proceedings of the ACM SIGMOD International Conference on Management of data,901\u2013912","DOI":"10.1145\/1989323.1989418"},{"key":"18328_CR19","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.jocs.2016.03.017","volume":"16","author":"J Liu","year":"2016","unstructured":"Liu J, Baomin Xu, Xiang Xu, Xin T (2016) A Link Prediction Algorithm Based on Label Propagation. Journal of Computational Science 16:43\u201350","journal-title":"Journal of Computational Science"},{"issue":"01","key":"18328_CR20","doi-asserted-by":"publisher","first-page":"1450001","DOI":"10.1142\/S0218001414500013","volume":"28","author":"P Foggia","year":"2014","unstructured":"Foggia P, Percannella G, Vento M (2014) Graph Matching and Learning in Pattern Recognition in the Last 10 Years. Int J Pattern Recognit Artif Intell 28(01):1450001","journal-title":"Int J Pattern Recognit Artif Intell"},{"issue":"2","key":"18328_CR21","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s00778-022-00749-x","volume":"32","author":"H Kim","year":"2023","unstructured":"Kim H, Choi Y, Park K, Lin X, Hong SH, Han WS (2023) Fast subgraph query processing and subgraph matching via static and dynamic equivalences. VLDB J 32(2):343\u2013368","journal-title":"VLDB J"},{"issue":"3","key":"18328_CR22","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1007\/s10115-022-01753-x","volume":"65","author":"X Wang","year":"2023","unstructured":"Wang X, Zhang Q, Guo D, Zhao X (2023) A survey of continuous subgraph matching for dynamic graphs. Knowl Inf Syst 65(3):945\u2013989","journal-title":"Knowl Inf Syst"},{"key":"18328_CR23","doi-asserted-by":"crossref","unstructured":"Ge, Y., Bertozzi, A. L. (2021). Active learning for the subgraph matching problem. In 2021 IEEE International Conference on Big Data (Big Data) (pp. 2641\u20132649). IEEE","DOI":"10.1109\/BigData52589.2021.9671760"},{"key":"18328_CR24","doi-asserted-by":"crossref","unstructured":"Wang, H., Zhang, Y., Qin, L., Wang, W., Zhang, W., Lin, X. (2022, May). Reinforcement learning based query vertex ordering model for subgraph matching. In 2022 IEEE 38th International Conference on Data Engineering (ICDE) (pp. 245\u2013258). IEEE","DOI":"10.1109\/ICDE53745.2022.00023"},{"key":"18328_CR25","doi-asserted-by":"crossref","unstructured":"Zhao, K., Yu, J. X., Li, Q., Zhang, H., Rong, Y. (2023). Learned sketch for subgraph counting: a holistic approach. The VLDB Journal, 1\u201326","DOI":"10.1007\/s00778-023-00781-5"},{"key":"18328_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.bdr.2022.100350","volume":"30","author":"H Zhang","year":"2022","unstructured":"Zhang H, Bai Q, Lian Y, Wen Y (2022) A twig-based algorithm for top-k subgraph matching in large-scale graph data. Big Data Research 30:100350","journal-title":"Big Data Research"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-024-18328-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11042-024-18328-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-024-18328-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,10]],"date-time":"2024-11-10T01:02:52Z","timestamp":1731200572000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11042-024-18328-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,3]]},"references-count":26,"journal-issue":{"issue":"27","published-online":{"date-parts":[[2024,8]]}},"alternative-id":["18328"],"URL":"https:\/\/doi.org\/10.1007\/s11042-024-18328-3","relation":{},"ISSN":["1573-7721"],"issn-type":[{"type":"electronic","value":"1573-7721"}],"subject":[],"published":{"date-parts":[[2024,2,3]]},"assertion":[{"value":"31 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 November 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 January 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 February 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}}]}}