{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:56:18Z","timestamp":1743076578062,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642021237"},{"type":"electronic","value":"9783642021244"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02124-4_11","type":"book-chapter","created":{"date-parts":[[2009,7,8]],"date-time":"2009-07-08T03:48:05Z","timestamp":1247024885000},"page":"102-112","source":"Crossref","is-referenced-by-count":8,"title":["A Polynomial Algorithm for Submap Isomorphism"],"prefix":"10.1007","author":[{"given":"Guillaume","family":"Damiand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Colin","family":"de la Higuera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Christophe","family":"Janodet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c9milie","family":"Samuel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christine","family":"Solnon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: An improved algorithm for matching large graphs. In: 3rd IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition, Ischia, Italy, pp. 149\u2013159 (2001)"},{"issue":"3","key":"11_CR2","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1142\/S0218001404003228","volume":"18","author":"D. Conte","year":"2004","unstructured":"Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. International Journal of Pattern Recognition and Artificial Intelligence\u00a018(3), 265\u2013298 (2004)","journal-title":"International Journal of Pattern Recognition and Artificial Intelligence"},{"key":"11_CR3","volume-title":"Ast\u00e9risque","author":"R. Cori","year":"1975","unstructured":"Cori, R.: Un code pour les graphes planaires et ses applications. In: Ast\u00e9risque, vol.\u00a027. Soc. Math. de, France (1975)"},{"issue":"2","key":"11_CR4","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.cviu.2003.09.001","volume":"93","author":"G. Damiand","year":"2004","unstructured":"Damiand, G., Bertrand, Y., Fiorio, C.: Topological model for two-dimensional image representation: definition and optimal extraction algorithm. Computer Vision and Image Understanding\u00a093(2), 111\u2013154 (2004)","journal-title":"Computer Vision and Image Understanding"},{"key":"11_CR5","unstructured":"Edmonds, J.: A combinatorial representation for polyhedral surfaces. In: Notices of the American Mathematical Society, vol. 7 (1960)"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/BFb0033230","volume-title":"Advances in Pattern Recognition","author":"X. Jiang","year":"1998","unstructured":"Jiang, X., Bunke, H.: Marked subgraph isomorphism of ordered graphs. In: Amin, A., Pudil, P., Dori, D. (eds.) SPR 1998 and SSPR 1998. LNCS, vol.\u00a01451, pp. 122\u2013131. Springer, Heidelberg (1998)"},{"issue":"7","key":"11_CR7","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1016\/S0031-3203(98)00145-9","volume":"32","author":"X. Jiang","year":"1999","unstructured":"Jiang, X., Bunke, H.: Optimal quadratic-time isomorphism of ordered graphs. Pattern Recognition\u00a032(7), 1273\u20131283 (1999)","journal-title":"Pattern Recognition"},{"issue":"1","key":"11_CR8","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0010-4485(91)90082-8","volume":"23","author":"P. Lienhardt","year":"1991","unstructured":"Lienhardt, P.: Topological models for boundary representation: a comparison with n-dimensional generalized maps. Computer-Aided Design\u00a023(1), 59\u201382 (1991)","journal-title":"Computer-Aided Design"},{"issue":"3","key":"11_CR9","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1142\/S0218195994000173","volume":"4","author":"P. Lienhardt","year":"1994","unstructured":"Lienhardt, P.: N-dimensional generalized combinatorial maps and cellular quasi-manifolds. International Journal of Computational Geometry and Applications\u00a04(3), 275\u2013324 (1994)","journal-title":"International Journal of Computational Geometry and Applications"},{"issue":"10","key":"11_CR10","doi-asserted-by":"publisher","first-page":"2213","DOI":"10.1016\/S0031-3203(03)00084-0","volume":"36","author":"B. Luo","year":"2003","unstructured":"Luo, B., Wilson, R.C., Hancock, E.R.: Spectral embedding of graphs. Pattern Recognition\u00a036(10), 2213\u20132230 (2003)","journal-title":"Pattern Recognition"},{"key":"11_CR11","first-page":"45","volume":"30","author":"B.D. McKay","year":"1981","unstructured":"McKay, B.D.: Practical graph isomorphism. Congressus Numerantium\u00a030, 45\u201387 (1981)","journal-title":"Congressus Numerantium"},{"key":"11_CR12","unstructured":"Poudret, M., Arnould, A., Bertrand, Y., Lienhardt, P.: Cartes combinatoires ouvertes. Research Notes 2007-1, Laboratoire SIC E.A. 4103, F-86962 Futuroscope Cedex - France (October 2007)"},{"issue":"4","key":"11_CR13","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/s10601-008-9044-1","volume":"13","author":"S. Sorlin","year":"2008","unstructured":"Sorlin, S., Solnon, C.: A parametric filtering algorithm for the graph isomorphism problem. Constraints\u00a013(4), 518\u2013537 (2008)","journal-title":"Constraints"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"249","DOI":"10.4153\/CJM-1963-029-x","volume":"15","author":"W.T. Tutte","year":"1963","unstructured":"Tutte, W.T.: A census of planar maps. Canad. J. Math.\u00a015, 249\u2013271 (1963)","journal-title":"Canad. J. Math."},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1007\/978-3-540-74970-7_51","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"S. Zampelli","year":"2007","unstructured":"Zampelli, S., Deville, Y., Solnon, C., Sorlin, S., Dupont, P.: Filtering for subgraph isomorphism. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 728\u2013742. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Graph-Based Representations in Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02124-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:11:33Z","timestamp":1558267893000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02124-4_11"}},"subtitle":["Application to Searching Patterns in Images"],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642021237","9783642021244"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02124-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}