{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:34:30Z","timestamp":1743068070026,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319394404"},{"type":"electronic","value":"9783319394411"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","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":[[2016]]},"DOI":"10.1007\/978-3-319-39441-1_7","type":"book-chapter","created":{"date-parts":[[2016,6,1]],"date-time":"2016-06-01T07:47:40Z","timestamp":1464767260000},"page":"65-76","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Computing the Overlaps of Two Maps"],"prefix":"10.1007","author":[{"given":"Jean-Christophe","family":"Janodet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Colin","family":"de la Higuera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,2]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Damiand, G., Lienhardt, P.: Combinatorial Maps: Efficient Data Structures for Computer Graphics and Image Processing. A K Peters\/CRC Press (2014)","DOI":"10.1201\/b17403"},{"key":"7_CR2","unstructured":"Cori, R.: Un code pour les graphes planaires et ses applications. Ph.D. thesis, Universit\u00e9 Paris 7 (1973)"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-642-02124-4_11","volume-title":"Graph-Based Representations in Pattern Recognition","author":"G Damiand","year":"2009","unstructured":"Damiand, G., de la Higuera, C., Janodet, J.-C., Samuel, \u00c9., Solnon, C.: A polynomial algorithm for submap isomorphism. In: Torsello, A., Escolano, F., Brun, L. (eds.) GbRPR 2009. LNCS, vol. 5534, pp. 102\u2013112. Springer, Heidelberg (2009)"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.tcs.2013.05.026","volume":"498","author":"C de la Higuera","year":"2013","unstructured":"de la Higuera, C., Janodet, J.C., Samuel, E., Damiand, G., Solnon, C.: Polynomial algorithms for open plane graph and subgraph isomorphisms. Theor. Comput. Sci. 498, 76\u201399 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR5","unstructured":"Dorn, F.: Planar subgraph isomorphism revisited. In: Proceedings of 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010), vol. 5 of LIPIcs., Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp. 263\u2013274(2010)"},{"issue":"3","key":"7_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.7155\/jgaa.00014","volume":"3","author":"D Eppstein","year":"1999","unstructured":"Eppstein, D.: Subgraph isomorphism in planar graphs and related problems. J. Graph Algorithms Appl. 3(3), 1\u201327 (1999)","journal-title":"J. Graph Algorithms Appl."},{"issue":"2","key":"7_CR7","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/j.patcog.2014.05.019","volume":"48","author":"C Solnon","year":"2015","unstructured":"Solnon, C., Damiand, G., de la Higuera, C., Janodet, J.C.: On the complexity of submap isomorphism and maximum common submap problems. Pattern Recogn. 48(2), 302\u2013316 (2015)","journal-title":"Pattern Recogn."},{"key":"7_CR8","unstructured":"Poudret, M., Arnould, A., Bertrand, Y., Lienhardt, P.: Cartes combinatoires ouvertes. Research Notes 2007\u20131, Laboratoire SIC E.A. 4103, F-86962 Futuroscope Cedex - France (2007)"},{"issue":"7","key":"7_CR9","doi-asserted-by":"publisher","first-page":"996","DOI":"10.1016\/j.cviu.2010.12.013","volume":"115","author":"G Damiand","year":"2011","unstructured":"Damiand, G., Solnon, C., de la Higuera, C., Janodet, J.C., Samuel, E.: Polynomial algorithms for subisomorphism of nD open combinatorial maps. Comput. Vis. Image Underst. 115(7), 996\u20131010 (2011)","journal-title":"Comput. Vis. Image Underst."},{"issue":"2","key":"7_CR10","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1137\/0211025","volume":"11","author":"D Lichtenstein","year":"1982","unstructured":"Lichtenstein, D.: Planar formul\u00e6 and their uses. SIAM J. Comput. 11(2), 329\u2013343 (1982)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Computational Topology in Image Context"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-39441-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:08:51Z","timestamp":1590970131000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-39441-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319394404","9783319394411"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-39441-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"2 June 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}