{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T05:10:06Z","timestamp":1751778606198,"version":"3.41.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319977843"},{"type":"electronic","value":"9783319977850"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-97785-0_46","type":"book-chapter","created":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T14:49:17Z","timestamp":1533134957000},"page":"481-490","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Association Graph Techniques for Hypergraph Matching"],"prefix":"10.1007","author":[{"given":"Giulia","family":"Sandi","sequence":"first","affiliation":[]},{"given":"Sebastiano","family":"Vascon","sequence":"additional","affiliation":[]},{"given":"Marcello","family":"Pelillo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,2]]},"reference":[{"issue":"4","key":"46_CR1","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0020-0190(76)90049-1","volume":"4","author":"HG Barrow","year":"1976","unstructured":"Barrow, H.G., Burstall, R.M.: Subgraph isomorphism, matching relational structures and maximal cliques. Inf. Process. Lett. 4(4), 83\u201384 (1976)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"46_CR2","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1090\/S0002-9904-1967-11751-8","volume":"73","author":"LE Baum","year":"1967","unstructured":"Baum, L.E., Eagon, J.A.: An inequality with applications to statistical estimation for probabilistic functions of Markov processes and to a model for ecology. Bull. Am. Math. Soc. 73(3), 360\u2013363 (1967)","journal-title":"Bull. Am. Math. Soc."},{"issue":"1","key":"46_CR3","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1214\/aoms\/1177697196","volume":"41","author":"LE Baum","year":"1970","unstructured":"Baum, L.E., Petrie, T., Soules, G., Weiss, N.: A maximization technique occurring in the statistical analysis of probabilistic functions of Markov chains. Ann. Math. Stat. 41(1), 164\u2013171 (1970)","journal-title":"Ann. Math. Stat."},{"issue":"5","key":"46_CR4","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1090\/S0002-9904-1964-11182-4","volume":"70","author":"GR Blakley","year":"1964","unstructured":"Blakley, G.R.: Homogeneous nonnegative symmetric quadratic transformations. Bull. Am. Math. Soc. 70(5), 712\u2013715 (1964)","journal-title":"Bull. Am. Math. Soc."},{"issue":"12","key":"46_CR5","doi-asserted-by":"publisher","first-page":"2383","DOI":"10.1109\/TPAMI.2011.110","volume":"33","author":"O Duchenne","year":"2011","unstructured":"Duchenne, O., Bach, F., Kweon, I., Ponce, J.: A tensor-based algorithm for high-order graph matching. IEEE Trans. Pattern Anal. Mach. Intell. 33(12), 2383\u20132395 (2011)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"46_CR6","volume-title":"Computers and Intractability","author":"MR Garey","year":"2002","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, vol. 29. WH Freeman, New York (2002)"},{"key":"46_CR7","doi-asserted-by":"crossref","unstructured":"Hou, J., Pelillo, M.: A game-theoretic hyper-graph matching algorithm. In: 24th International Conference on Pattern Recognition (ICPR) (2018)","DOI":"10.1109\/ICPR.2018.8545827"},{"issue":"2","key":"46_CR8","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1145\/990524.990529","volume":"10","author":"D Kozen","year":"1978","unstructured":"Kozen, D.: A clique problem equivalent to graph isomorphism. ACM SIGACT News 10(2), 50\u201352 (1978)","journal-title":"ACM SIGACT News"},{"key":"46_CR9","first-page":"1633","volume":"2011","author":"J Lee","year":"2011","unstructured":"Lee, J., Cho, M., Lee, K.M.: Hyper-graph matching via reweighted random walks. CVPR 2011, 1633\u20131640 (2011)","journal-title":"CVPR"},{"key":"46_CR10","doi-asserted-by":"publisher","first-page":"533","DOI":"10.4153\/CJM-1965-053-6","volume":"17","author":"TS Motzkin","year":"1965","unstructured":"Motzkin, T.S., Straus, E.G.: Maxima for graphs and a new proof of a theorem of Tur\u00e1n. Canad. J. Math. 17, 533\u2013540 (1965)","journal-title":"Canad. J. Math."},{"issue":"4","key":"46_CR11","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1023\/A:1008255111261","volume":"7","author":"M Pelillo","year":"1997","unstructured":"Pelillo, M.: The dynamics of nonlinear relaxation labeling processes. J. Math. Imaging Vis. 7(4), 309\u2013323 (1997)","journal-title":"J. Math. Imaging Vis."},{"key":"46_CR12","doi-asserted-by":"crossref","unstructured":"Pelillo, M.: A unifying framework for relational structure matching. In: Proceedings of 14th International Conference on Pattern Recognition, (ICPR), pp. 1316\u20131319 (1998)","DOI":"10.1109\/ICPR.1998.711944"},{"issue":"8","key":"46_CR13","doi-asserted-by":"publisher","first-page":"1933","DOI":"10.1162\/089976699300016034","volume":"11","author":"M Pelillo","year":"1999","unstructured":"Pelillo, M.: Replicator equations, maximal cliques, and graph isomorphism. Neural Comput. 11(8), 1933\u20131955 (1999)","journal-title":"Neural Comput."},{"issue":"2","key":"46_CR14","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s11590-008-0108-3","volume":"3","author":"S Rota Bul\u00f2","year":"2009","unstructured":"Rota Bul\u00f2, S., Pelillo, M.: A generalization of the Motzkin-Straus theorem to hypergraphs. Optim. Lett. 3(2), 287\u2013295 (2009)","journal-title":"Optim. Lett."},{"issue":"6","key":"46_CR15","doi-asserted-by":"publisher","first-page":"1312","DOI":"10.1109\/TPAMI.2012.226","volume":"35","author":"S Rota Bul\u00f2","year":"2013","unstructured":"Rota Bul\u00f2, S., Pelillo, M.: A game-theoretic approach to hypergraph clustering. IEEE Trans. Pattern Anal. Mach. Intell. 35(6), 1312\u20131327 (2013)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"46_CR16","doi-asserted-by":"crossref","unstructured":"Yan, J., Zhang, C., Zha, H., Liu, W., Yang, X., Chu, S.M.: Discrete hyper-graph matching. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 1520\u20131528 (2015)","DOI":"10.1109\/CVPR.2015.7298759"},{"key":"46_CR17","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.patrec.2016.07.011","volume":"87","author":"H Zhang","year":"2017","unstructured":"Zhang, H., Ren, P.: Game theoretic hypergraph matching for multi-source image correspondences. Pattern Recogn. Lett. 87, 87\u201395 (2017)","journal-title":"Pattern Recogn. Lett."}],"container-title":["Lecture Notes in Computer Science","Structural, Syntactic, and Statistical Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-97785-0_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T04:40:00Z","timestamp":1751776800000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-97785-0_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319977843","9783319977850"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-97785-0_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"2 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"S+SSPR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint IAPR International Workshops on Statistical Techniques in Pattern Recognition (SPR) and Structural and Syntactic Pattern Recognition (SSPR)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 August 2018","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":"sspr2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ssspr2018.buaa.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}