{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:00:29Z","timestamp":1725894029021},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642382208"},{"type":"electronic","value":"9783642382215"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38221-5_3","type":"book-chapter","created":{"date-parts":[[2013,5,5]],"date-time":"2013-05-05T20:48:12Z","timestamp":1367786892000},"page":"21-30","source":"Crossref","is-referenced-by-count":1,"title":["On the Complexity of Submap Isomorphism"],"prefix":"10.1007","author":[{"given":"Christine","family":"Solnon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillaume","family":"Damiand","sequence":"additional","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"}]}],"member":"297","reference":[{"issue":"3","key":"3_CR1","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. Computational Geometry and Applications\u00a04(3), 275\u2013324 (1994)","journal-title":"Computational Geometry and Applications"},{"issue":"2","key":"3_CR2","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1111\/j.1467-8659.2006.00931.x","volume":"25","author":"D. Fradin","year":"2006","unstructured":"Fradin, D., Meneveaux, D., Lienhardt, P.: A hierarchical topology-based model for handling complex indoor scenes. Computer Graphics Forum\u00a025(2), 149\u2013162 (2006)","journal-title":"Computer Graphics Forum"},{"issue":"1","key":"3_CR3","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1006\/jvci.1998.0374","volume":"9","author":"J.P. Braquelaire","year":"1998","unstructured":"Braquelaire, J.P., Brun, L.: Image segmentation with topological maps and inter-pixel representation. Visual Communication and Image Representation\u00a09(1), 62\u201379 (1998)","journal-title":"Visual Communication and Image Representation"},{"key":"3_CR4","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: Application to searching patterns in images. In: Torsello, A., Escolano, F., Brun, L. (eds.) GbRPR 2009. LNCS, vol.\u00a05534, pp. 102\u2013112. Springer, Heidelberg (2009)"},{"issue":"7","key":"3_CR5","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. Computer Vision and Image Understanding (CVIU)\u00a0115(7), 996\u20131010 (2011)","journal-title":"Computer Vision and Image Understanding (CVIU)"},{"issue":"15","key":"3_CR6","doi-asserted-by":"publisher","first-page":"2020","DOI":"10.1016\/j.patrec.2012.04.006","volume":"33","author":"C. Combier","year":"2012","unstructured":"Combier, C., Damiand, G., Solnon, C.: From maximum common submaps to edit distances of generalized maps. Pattern Recognition Letters\u00a033(15), 2020\u20132028 (2012)","journal-title":"Pattern Recognition Letters"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: ACM Symposium on Theory of Computing, pp. 151\u2013158 (1971)","DOI":"10.1145\/800157.805047"},{"issue":"1-2","key":"3_CR8","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0304-3975(94)00230-G","volume":"147","author":"K. Jansen","year":"1995","unstructured":"Jansen, K., M\u00fcller, H.: The minimum broadcast time problem for several processor networks. Theoretical Computer Science\u00a0147(1-2), 69\u201385 (1995)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"3_CR9","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1137\/S089548019529248X","volume":"12","author":"B. Mohar","year":"1999","unstructured":"Mohar, B.: A linear time algorithm for embedding graphs in an arbitrary surface. SIAM Journal on Discrete Mathematics\u00a012(1), 6\u201326 (1999)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-642-20844-7_9","volume-title":"Graph-Based Representations in Pattern Recognition","author":"C. Combier","year":"2011","unstructured":"Combier, C., Damiand, G., Solnon, C.: Measuring the distance of generalized maps. In: Jiang, X., Ferrer, M., Torsello, A. (eds.) GbRPR 2011. LNCS, vol.\u00a06658, pp. 82\u201391. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Graph-Based Representations in Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38221-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,27]],"date-time":"2019-01-27T22:00:33Z","timestamp":1548626433000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38221-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642382208","9783642382215"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38221-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}