{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T12:59:25Z","timestamp":1769777965412,"version":"3.49.0"},"publisher-location":"Singapore","reference-count":21,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819557189","type":"print"},{"value":"9789819557196","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-5719-6_3","type":"book-chapter","created":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T20:34:38Z","timestamp":1769718878000},"page":"34-50","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Finding Maximum Common Subgraphs Efficiently Through Dynamic Bidirectional Vertex Selection"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8814-3660","authenticated-orcid":false,"given":"Yicheng","family":"Hu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0199-4740","authenticated-orcid":false,"given":"Xibo","family":"Sun","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2861-9492","authenticated-orcid":false,"given":"Qiong","family":"Luo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,30]]},"reference":[{"issue":"18","key":"3_CR1","doi-asserted-by":"publisher","first-page":"2523","DOI":"10.1016\/j.dam.2012.01.026","volume":"160","author":"L Bahiense","year":"2012","unstructured":"Bahiense, L., Mani\u0107, G., Piva, B., De Souza, C.C.: The maximum common edge subgraph problem: A polyhedral investigation. Discret. Appl. Math. 160(18), 2523\u20132541 (2012)","journal-title":"Discret. Appl. Math."},{"issue":"13","key":"3_CR2","doi-asserted-by":"publisher","first-page":"i366","DOI":"10.1093\/bioinformatics\/btn186","volume":"24","author":"Y Cao","year":"2008","unstructured":"Cao, Y., Jiang, T., Girke, T.: A maximum common substructure-based algorithm for searching and predicting drug-like compounds. Bioinformatics 24(13), i366\u2013i374 (2008)","journal-title":"Bioinformatics"},{"issue":"1","key":"3_CR3","first-page":"68","volume":"1","author":"HC Ehrlich","year":"2011","unstructured":"Ehrlich, H.C., Rarey, M.: Maximum common subgraph isomorphism algorithms and their applications in molecular science: a review. Wiley Interdisc. Rev.: Comput. Mol. Sci. 1(1), 68\u201379 (2011)","journal-title":"Wiley Interdisc. Rev.: Comput. Mol. Sci."},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Hjort\u00a0Blindell, G., Casta\u00f1eda\u00a0Lozano, R., Carlsson, M., Schulte, C.: Modeling universal instruction selection. In: Principles and Practice of Constraint Programming: 21st International Conference, CP 2015, Cork, Ireland, August 31\u2013September 4, 2015, Proceedings 21, pp. 609\u2013626. Springer (2015)","DOI":"10.1007\/978-3-319-23219-5_42"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Hoffmann, R., McCreesh, C., Reilly, C.: Between subgraph isomorphism and maximum common subgraph. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a031 (2017)","DOI":"10.1609\/aaai.v31i1.11137"},{"key":"3_CR6","unstructured":"Jiang, H., Ngo, C.W.: Image mining using inexact maximal common subgraph of multiple args. In: International Conference on Visual Information System, vol.\u00a02, p.\u00a03 (2003)"},{"issue":"1\u20132","key":"3_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(00)00286-3","volume":"250","author":"I Koch","year":"2001","unstructured":"Koch, I.: Enumerating all connected maximal common subgraphs in two graphs. Theoret. Comput. Sci. 250(1\u20132), 1\u201330 (2001)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"3_CR8","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/BF02575586","volume":"9","author":"G Levi","year":"1973","unstructured":"Levi, G.: A note on the derivation of maximal common subgraphs of two directed or undirected graphs. Calcolo 9(4), 341\u2013352 (1973)","journal-title":"Calcolo"},{"key":"3_CR9","unstructured":"Li, Y., Gu, C., Dullien, T., Vinyals, O., Kohli, P.: Graph matching networks for learning the similarity of graph structured objects. In: International Conference on Machine Learning, pp. 3835\u20133845. PMLR (2019)"},{"issue":"03","key":"3_CR10","doi-asserted-by":"publisher","first-page":"2392","DOI":"10.1609\/aaai.v34i03.5619","volume":"34","author":"Y Liu","year":"2020","unstructured":"Liu, Y., Li, C.M., Jiang, H., He, K.: A learning based branch and bound for maximum common subgraph related problems. Proc. AAAI Conf. Artif. Intell. 34(03), 2392\u20132399 (2020). https:\/\/doi.org\/10.1609\/aaai.v34i03.5619","journal-title":"Proc. AAAI Conf. Artif. Intell."},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Liu, Y., Zhao, J., Li, C.M., Jiang, H., He, K.: Hybrid learning with new value function for the maximum common induced subgraph problem. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a037, pp. 4044\u20134051 (2023)","DOI":"10.1609\/aaai.v37i4.25519"},{"key":"3_CR12","unstructured":"Lowe, D.M.: Extraction of chemical structures and reactions from the literature. Ph.D. thesis, University of Cambridge (2012)"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"McCreesh, C., Ndiaye, S.N., Prosser, P., Solnon, C.: Clique and constraint models for maximum common (connected) subgraph problems. In: Principles and Practice of Constraint Programming: 22nd International Conference, CP 2016, Toulouse, France, September 5-9, 2016, Proceedings 22, pp. 350\u2013368. Springer (2016)","DOI":"10.1007\/978-3-319-44953-1_23"},{"key":"3_CR14","doi-asserted-by":"publisher","unstructured":"McCreesh, C., Prosser, P., Trimble, J.: A partitioning algorithm for maximum common subgraph problems. In: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence (2017). https:\/\/doi.org\/10.24963\/ijcai.2017\/99","DOI":"10.24963\/ijcai.2017\/99"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"McGregor, J.J.: Backtrack search algorithms and the maximal common subgraph problem. Software: Practice and Experience 12(1), 23\u201334 (1982)","DOI":"10.1002\/spe.4380120103"},{"key":"3_CR16","doi-asserted-by":"publisher","unstructured":"Ndiaye, S.N., Solnon, C.: Cp models for maximum common subgraph problems. Principles and Practice of Constraint Programming \u2013 CP 2011 pp. 637\u2013644 (2011). https:\/\/doi.org\/10.1007\/978-3-642-23786-7_48","DOI":"10.1007\/978-3-642-23786-7_48"},{"issue":"4","key":"3_CR17","doi-asserted-by":"publisher","first-page":"545","DOI":"10.3390\/a5040545","volume":"5","author":"P Prosser","year":"2012","unstructured":"Prosser, P.: Exact algorithms for maximum clique: a computational study. Algorithms 5(4), 545\u2013587 (2012)","journal-title":"Algorithms"},{"key":"3_CR18","first-page":"32112","volume":"35","author":"I Roy","year":"2022","unstructured":"Roy, I., Chakrabarti, S., De, A.: Maximum common subgraph guided graph retrieval: late and early interaction networks. Adv. Neural. Inf. Process. Syst. 35, 32112\u201332126 (2022)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Vismara, P., Valery, B.: Finding maximum common connected subgraphs using clique detection or constraint satisfaction algorithms. In: Modelling, Computation and Optimization in Information Systems and Management Sciences: Second International Conference MCO 2008, Metz, France-Luxembourg, September 8-10, 2008. Proceedings, pp. 358\u2013368. Springer (2008)","DOI":"10.1007\/978-3-540-87477-5_39"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Weininger, D.: Smiles, a chemical language and information system. 1. introduction to methodology and encoding rules. J. Chem. Inform. Comput. Sci. 28(1), 31\u201336 (1988)","DOI":"10.1021\/ci00057a005"},{"key":"3_CR21","doi-asserted-by":"publisher","unstructured":"Zhou, J., He, K., Zheng, J., Li, C.M., Liu, Y.: A strengthened branch and bound algorithm for the maximum common (connected) subgraph problem. In: Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence (2022). https:\/\/doi.org\/10.24963\/ijcai.2022\/265","DOI":"10.24963\/ijcai.2022\/265"}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-5719-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T20:34:42Z","timestamp":1769718882000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-5719-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819557189","9789819557196"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-5719-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"30 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APWeb-WAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenyang","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/apweb2025.sau.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}