{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T22:40:06Z","timestamp":1747176006073,"version":"3.40.5"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319131856"},{"type":"electronic","value":"9783319131863"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-319-13186-3_3","type":"book-chapter","created":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T20:09:58Z","timestamp":1417464598000},"page":"22-28","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Joint Tree of Combinatorial Maps"],"prefix":"10.1007","author":[{"given":"Tao","family":"Wang","sequence":"first","affiliation":[]},{"given":"Congyan","family":"Lang","sequence":"additional","affiliation":[]},{"given":"Songhe","family":"Feng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,11,26]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1112\/plms\/s3-37.2.273","volume":"3","author":"GA Jones","year":"1978","unstructured":"Jones, G.A., Singerman, D.: Theory of maps on orientable surfaces. Proc. Lond. Math. Soc. 3, 273\u2013307 (1978)","journal-title":"Proc. Lond. Math. Soc."},{"issue":"8","key":"3_CR2","doi-asserted-by":"publisher","first-page":"1051","DOI":"10.1016\/S0167-8655(02)00251-9","volume":"24","author":"L Brun","year":"2003","unstructured":"Brun, L., Kropatsch, W.: Contraction kernels and combinatorial maps. Pattern Recogn. Lett. 24(8), 1051\u20131057 (2003)","journal-title":"Pattern Recogn. Lett."},{"issue":"4","key":"3_CR3","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1016\/j.patcog.2005.10.015","volume":"39","author":"L Brun","year":"2006","unstructured":"Brun, L., Kropatsch, W.: Contains and inside relationships within combinatorial pyramids. Pattern Recogn. 39(4), 515\u2013526 (2006)","journal-title":"Pattern Recogn."},{"issue":"3","key":"3_CR4","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/j.cviu.2007.09.007","volume":"109","author":"G Damiand","year":"2008","unstructured":"Damiand, G.: Topological model for 3D image representation: definition and incremental extraction algorithm. Comput. Vis. Image Underst. 109(3), 260\u2013289 (2008)","journal-title":"Comput. Vis. Image Underst."},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-540-79126-3_45","volume-title":"Discrete Geometry for Computer Imagery","author":"A Dupas","year":"2008","unstructured":"Dupas, A., Damiand, G.: First Results for 3D image segmentation with topological map. In: Coeurjolly, D., Sivignon, I., Tougne, L., Dupont, F. (eds.) DGCI 2008. LNCS, vol. 4992, pp. 507\u2013518. Springer, Heidelberg (2008)"},{"issue":"4","key":"3_CR6","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1016\/j.media.2009.05.004","volume":"13","author":"T Heimann","year":"2009","unstructured":"Heimann, T., MeinZer, H.P.: Statistical shape models for 3D medical image segmentation: a review. Med. Image Anal. 13(4), 543\u2013563 (2009)","journal-title":"Med. Image Anal."},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Dufourd, D., Chatila, R.: Combinatorial maps for simultaneous localization and map building(SLAM). In: IEEE\/RSJ International Conference on Intelligent Robots and Systems, pp 1047\u20131052 (2004)","DOI":"10.1109\/IROS.2004.1389535"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Teng, Z., Kang, D.J.: Disjunctive normal form of weak classifiers for online learning based object tracking. In: Proceedings of VISAPP, vol. 2, pp. 138\u2013146. SciTePress (2013)","DOI":"10.5220\/0004240501380146"},{"issue":"3","key":"3_CR9","doi-asserted-by":"publisher","first-page":"1127","DOI":"10.1021\/cr0780006","volume":"108","author":"GD Ramon","year":"2008","unstructured":"Ramon, G.D., Jorge, G., Jesus, J.O., Lionello, P.: Some new trends in chemical graph theory. Chem. Rev. 108(3), 1127\u20131169 (2008)","journal-title":"Chem. Rev."},{"key":"3_CR10","unstructured":"Cori, R.: Computation of the automorphism group of a topological graph embedding. Technical report (1985)"},{"key":"3_CR11","volume-title":"Advances in Combinatorial Maps","author":"YP Liu","year":"2003","unstructured":"Liu, Y.P.: Advances in Combinatorial Maps. Northen Jiaotong University Press, Beijing (2003). (In Chinese)"},{"issue":"2","key":"3_CR12","first-page":"58","volume":"12","author":"T Wang","year":"2008","unstructured":"Wang, T., Liu, Y.P.: Implements of some new algorithms for combinatorial maps. OR Trans. 12(2), 58\u201366 (2008)","journal-title":"OR Trans."},{"issue":"15","key":"3_CR13","doi-asserted-by":"publisher","first-page":"1392","DOI":"10.1016\/j.tcs.2010.10.029","volume":"412","author":"S Gossenlin","year":"2011","unstructured":"Gossenlin, S., Damiand, G., Solnon, C.: Efficient search of combinatorial maps using signatures. Theor. Comput. Sci. 412(15), 1392\u20131405 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"996","DOI":"10.1016\/j.cviu.2010.12.013","volume":"1157","author":"G Damiand","year":"2011","unstructured":"Damiand, G., Solnon, C., Higuera, C., Jandodet, J.-C., Samuel, E.: Polynomial algorithms for subisomorphism of nD open combinatorial maps. Comput. Vis. Image Underst. 1157, 996\u20131010 (2011)","journal-title":"Comput. Vis. Image Underst."},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"1100","DOI":"10.1016\/j.patrec.2011.02.021","volume":"32","author":"T Wang","year":"2011","unstructured":"Wang, T., Dai, G.J., Xu, D.: A polynomial algorithm for submap isomorphism of general maps. Pattern Recogn. Lett. 32, 1100\u20131107 (2011)","journal-title":"Pattern Recogn. Lett."},{"key":"3_CR16","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. 6658, pp. 82\u201391. Springer, Heidelberg (2011)"},{"issue":"25","key":"3_CR17","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 Recogn. Lett. 33(25), 2020\u20132028 (2012)","journal-title":"Pattern Recogn. Lett."},{"issue":"12","key":"3_CR18","doi-asserted-by":"publisher","first-page":"1168","DOI":"10.1016\/j.cviu.2012.08.002","volume":"116","author":"T Wang","year":"2012","unstructured":"Wang, T., Dai, G.J., Ni, B., Xu, D., Siewe, F.: A distance measure between labeled combinatorial maps. Comput. Vis. Image Underst. 116(12), 1168\u20131177 (2012)","journal-title":"Comput. Vis. Image Underst."},{"issue":"1","key":"3_CR19","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.tcs.2004.12.030","volume":"337","author":"P Bille","year":"2005","unstructured":"Bille, P.: A survey on tree edit distance and related problems. Theor. Comput. Sci. 337(1), 217\u2013239 (2005)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Trends and Applications in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13186-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T22:11:16Z","timestamp":1747174276000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-13186-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319131856","9783319131863"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13186-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"26 November 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}