{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T22:51:14Z","timestamp":1769986274907,"version":"3.49.0"},"publisher-location":"Singapore","reference-count":26,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819549689","type":"print"},{"value":"9789819549696","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T00:00:00Z","timestamp":1764028800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T00:00:00Z","timestamp":1764028800000},"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-4969-6_35","type":"book-chapter","created":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T08:47:55Z","timestamp":1763974075000},"page":"458-470","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Solving Partial Graph Matching as\u00a0a\u00a0Stable Matching Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9960-2607","authenticated-orcid":false,"given":"Gathika","family":"Ratnayaka","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1147-280X","authenticated-orcid":false,"given":"Yang","family":"Li","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9486-3648","authenticated-orcid":false,"given":"James","family":"Nichols","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9504-4273","authenticated-orcid":false,"given":"Qing","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,11,25]]},"reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"Burkard, R., Dell\u2019Amico, M., Martello, S.: Assignment problems: revised reprint. SIAM (2012)","DOI":"10.1137\/1.9781611972238"},{"key":"35_CR2","unstructured":"Fey, M., Lenssen, J.E., Morris, C., Masci, J., Kriege, N.M.: Deep graph matching consensus. arXiv preprint arXiv:2001.09621 (2020)"},{"issue":"1","key":"35_CR3","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Mon. 69(1), 9\u201315 (1962)","journal-title":"Am. Math. Mon."},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Gao, Q., Wang, F., Xue, N., Yu, J.G., Xia, G.S.: Deep graph matching under quadratic constraint. In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp. 5069\u20135078 (2021)","DOI":"10.1109\/CVPR46437.2021.00503"},{"key":"35_CR5","unstructured":"Jiang, Z., Lu, J., Fan, H., Wang, T., Yan, J.: Learning structured universe graph with outlier ood detection for partial matching. In: The Thirteenth International Conference on Learning Representations (2025)"},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"Jiang, Z., Rahmani, H., Angelov, P., Black, S., Williams, B.M.: Graph-context attention networks for size-varied deep graph matching. In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp. 2343\u20132352 (2022)","DOI":"10.1109\/CVPR52688.2022.00238"},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Koopmans, T.C., Beckmann, M.: Assignment problems and the location of economic activities. Econometrica: J. Econometric Soc. 53\u201376 (1957)","DOI":"10.2307\/1907742"},{"key":"35_CR8","unstructured":"Liu, L., Hughes, M.C., Hassoun, S., Liu, L.: Stochastic iterative graph matching. In: International Conference on Machine Learning (2021)"},{"issue":"3","key":"35_CR9","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01934199","volume":"10","author":"DG McVitie","year":"1970","unstructured":"McVitie, D.G., Wilson, L.B.: Stable marriage assignment for unequal sets. BIT Numer. Math. 10(3), 295\u2013309 (1970)","journal-title":"BIT Numer. Math."},{"issue":"10","key":"35_CR10","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2005\/10\/P10008","volume":"2005","author":"S Mertens","year":"2005","unstructured":"Mertens, S.: Random stable matchings. J. Stat. Mech. Theory Exp. 2005(10), P10008 (2005)","journal-title":"J. Stat. Mech. Theory Exp."},{"key":"35_CR11","unstructured":"Min, J., Lee, J., Ponce, J., Cho, M.: Spair-71k: a large-scale benchmark for semantic correspondence. arXiv preprint arXiv:1908.10543 (2019)"},{"key":"35_CR12","unstructured":"Nakada, K., Kawamura, K., Furukawa, R.: Parallel and mini-batch stable matching for large-scale reciprocal recommender systems. arXiv preprint arXiv:2411.19214 (2024)"},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"Nurlanov, Z., Schmidt, F.R., Bernard, F.: Universe points representation learning for partial multi-graph matching. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a037, pp. 1984\u20131992 (2023)","DOI":"10.1609\/aaai.v37i2.25290"},{"key":"35_CR14","doi-asserted-by":"publisher","first-page":"746","DOI":"10.1016\/j.procs.2019.09.230","volume":"159","author":"I Ouali","year":"2019","unstructured":"Ouali, I., Ghozzi, F., Taktak, R., Sassi, M.S.H.: Ontology alignment using stable matching. Procedia Comput. Sci. 159, 746\u2013755 (2019)","journal-title":"Procedia Comput. Sci."},{"key":"35_CR15","unstructured":"Ratnayaka, G., Nichols, J., Wang, Q.: Learning partial graph matching via optimal partial transport. In: The Thirteenth International Conference on Learning Representations (2025)"},{"key":"35_CR16","unstructured":"Ratnayaka, G., Wang, Q., Li, Y.: Contrastive learning for supervised graph matching. In: Uncertainty in Artificial Intelligence, pp. 1718\u20131729. PMLR (2023)"},{"key":"35_CR17","doi-asserted-by":"crossref","unstructured":"Rol\u00ednek, M., Swoboda, P., Zietlow, D., Paulus, A., Musil, V., Martius, G.: Deep graph matching via blackbox differentiation of combinatorial solvers. In: European Conference on Computer Vision (2020)","DOI":"10.1007\/978-3-030-58604-1_25"},{"key":"35_CR18","doi-asserted-by":"crossref","unstructured":"Sun, H., Zhou, W., Fei, M.: A survey on graph matching in computer vision. In: 2020 13th International Congress on Image and Signal Processing, BioMedical Engineering and Informatics (CISP-BMEI) (2020)","DOI":"10.1109\/CISP-BMEI51763.2020.9263681"},{"key":"35_CR19","doi-asserted-by":"crossref","unstructured":"Wang, R., Guo, Z., Jiang, S., Yang, X., Yan, J.: Deep learning of partial graph matching via differentiable top-k. In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp. 6272\u20136281 (2023)","DOI":"10.1109\/CVPR52729.2023.00607"},{"issue":"6","key":"35_CR20","doi-asserted-by":"publisher","first-page":"6984","DOI":"10.1109\/TPAMI.2020.3005590","volume":"45","author":"R Wang","year":"2020","unstructured":"Wang, R., Yan, J., Yang, X.: Combinatorial learning of robust deep graph matching: an embedding based approach. IEEE Trans. Pattern Anal. Mach. Intell. 45(6), 6984\u20137000 (2020)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"9","key":"35_CR21","first-page":"5261","volume":"44","author":"R Wang","year":"2021","unstructured":"Wang, R., Yan, J., Yang, X.: Neural graph matching network: learning Lawler\u2019s quadratic assignment problem with extension to hypergraph and multiple-graph matching. IEEE Trans. Pattern Anal. Mach. Intell. 44(9), 5261\u20135279 (2021)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"35_CR22","doi-asserted-by":"crossref","unstructured":"Wu, J.: Stable matching beyond bipartite graphs. In: 2016 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), pp. 480\u2013488. IEEE (2016)","DOI":"10.1109\/IPDPSW.2016.207"},{"key":"35_CR23","unstructured":"Xu, H., Luo, D., Carin, L.: Scalable Gromov-Wasserstein learning for graph partitioning and matching. Adv. Neural Inf. Process. Syst. 32 (2019)"},{"key":"35_CR24","unstructured":"Yu, T., Wang, R., Yan, J., Li, B.: Learning deep graph matching with channel-independent embedding and Hungarian attention. In: International Conference on Learning Representations (2020)"},{"issue":"12","key":"35_CR25","doi-asserted-by":"publisher","first-page":"12770","DOI":"10.1109\/TKDE.2023.3272584","volume":"35","author":"W Zeng","year":"2023","unstructured":"Zeng, W., Zhao, X., Tan, Z., Tang, J., Cheng, X.: Matching knowledge graphs in entity embedding spaces: an experimental study. IEEE Trans. Knowl. Data Eng. 35(12), 12770\u201312784 (2023)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"35_CR26","unstructured":"Zheng, Z., Zheng, L., Hu, Z., Yang, Y.: Open set adversarial examples, 3 (2018). arXiv preprint arXiv:1809.02681"}],"updated-by":[{"DOI":"10.1007\/978-981-95-4969-6_36","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000}}],"container-title":["Lecture Notes in Computer Science","AI 2025: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-4969-6_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T20:57:34Z","timestamp":1769893054000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-4969-6_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,25]]},"ISBN":["9789819549689","9789819549696"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-4969-6_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,25]]},"assertion":[{"value":"25 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"1 February 2026","order":2,"name":"change_date","label":"Change Date","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Correction","order":3,"name":"change_type","label":"Change Type","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"A correction has been published.","order":4,"name":"change_details","label":"Change Details","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"AI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Joint Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canberra, ACT","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","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":"1 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"38","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ausai2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ajcai2025.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}