{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T03:27:54Z","timestamp":1725593274029},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642214578"},{"type":"electronic","value":"9783642214585"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-21458-5_36","type":"book-chapter","created":{"date-parts":[[2011,6,27]],"date-time":"2011-06-27T17:11:27Z","timestamp":1309194687000},"page":"429-440","source":"Crossref","is-referenced-by-count":1,"title":["Frequent Submap Discovery"],"prefix":"10.1007","author":[{"given":"St\u00e9phane","family":"Gosselin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillaume","family":"Damiand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christine","family":"Solnon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"crossref","unstructured":"Braquelaire, J.-P., Brun, L.: Image segmentation with topological maps and inter-pixel representation\u00a09(1), 62\u201379 (March 1998)","DOI":"10.1006\/jvci.1998.0374"},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"Brisson, E.: Representing geometric structures in d dimensions: topology and order. In: SCG, Saarbr\u00fccken, Germany, pp. 218\u2013227 (1989)","DOI":"10.1145\/73833.73858"},{"key":"36_CR3","first-page":"161","volume":"66","author":"Y. Chi","year":"2004","unstructured":"Chi, Y., Muntz, R.R., Nijssen, S., Kok, J.N.: Frequent subtree mining - an overview. Fundam. Inf.\u00a066, 161\u2013198 (2004)","journal-title":"Fundam. Inf."},{"key":"36_CR4","unstructured":"Cori, R.: Un code pour les graphes planaires et ses applications. In: Ast\u00e9risque, Soc. Math. de France, Paris, France, vol.\u00a027 (1975)"},{"issue":"3","key":"36_CR5","first-page":"260","volume":"109","author":"G. Damiand","year":"2008","unstructured":"Damiand, G.: Topological model for 3d image representation: Definition and incremental extraction algorithm. CVIU\u00a0109(3), 260\u2013289 (2008)","journal-title":"CVIU"},{"issue":"2","key":"36_CR6","first-page":"111","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. CVIU\u00a093(2), 111\u2013154 (2004)","journal-title":"CVIU"},{"key":"36_CR7","series-title":"LNCS","first-page":"102","volume-title":"GbR","author":"G. Damiand","year":"2009","unstructured":"Damiand, G., De La Higuera, C., Janodet, J.-C., Samuel, E., Solnon, C.: Polynomial Algorithm for Submap Isomorphism: Application to searching patterns in images. In: GbR. LNCS, pp. 102\u2013112. Springer, Heidelberg (2009)"},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"Damiand, G., Solnon, C., De La Higuera, C., Janodet, J.-C., Samuel, E.: Polynomial Algorithms for Subisomorphism of nD Open Combinatorial Maps. In: Computer Vision and Image Understanding (CVIU) (December 2011)","DOI":"10.1016\/j.cviu.2010.12.013"},{"key":"36_CR9","unstructured":"Edmonds, J.: A combinatorial representation for polyhedral surfaces. Notices of the American Mathematical Society\u00a07 (1960)"},{"issue":"15","key":"36_CR10","doi-asserted-by":"publisher","first-page":"1392","DOI":"10.1016\/j.tcs.2010.10.029","volume":"412","author":"S. Gosselin","year":"2011","unstructured":"Gosselin, S., Damiand, G., Solnon, C.: Efficient search of combinatorial maps using signatures. Theoretical Computer Science\u00a0412(15), 1392\u20131405 (2011); Theoretical Computer Science Issues in Image Analysis and Processing","journal-title":"Theoretical Computer Science"},{"key":"36_CR11","doi-asserted-by":"crossref","unstructured":"Horvath, T., Ramon, J., Wrobel, S.: Frequent subgraph mining in outerplanar graphs. In: KDD 2006, pp. 197\u2013206 (2006)","DOI":"10.1145\/1150402.1150427"},{"key":"36_CR12","first-page":"657","volume":"2","author":"A. Jacques","year":"1970","unstructured":"Jacques, A.: Constellations et graphes topologiques. Combinatorial Theory and Applications\u00a02, 657\u2013673 (1970)","journal-title":"Combinatorial Theory and Applications"},{"key":"36_CR13","doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: IEEE International Conference on Data Mining, vol.\u00a00, p. 313 (2001)","DOI":"10.1109\/ICDM.2001.989534"},{"key":"36_CR14","doi-asserted-by":"crossref","unstructured":"Lienhardt, P.: Subdivision of n-dimensional spaces and n-dimensional generalized maps. In: SCG, Saarbr\u00fccken, Germany, pp. 228\u2013236 (1989)","DOI":"10.1145\/73833.73859"},{"issue":"1","key":"36_CR15","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":"36_CR16","first-page":"275","volume":"4","author":"P. Lienhardt","year":"1994","unstructured":"Lienhardt, P.: N-dimensional generalized combinatorial maps and cellular quasi-manifolds. IJCGA\u00a04(3), 275\u2013324 (1994)","journal-title":"IJCGA"},{"key":"36_CR17","unstructured":"Poudret, M., Arnould, A., Bertrand, Y., Lienhardt, P.: Cartes combinatoires ouvertes. Research Notes 2007-1, Laboratoire SIC E.A.\u00a04103 (October 2007)"},{"key":"36_CR18","first-page":"235","volume-title":"Machine Learning 1994","author":"S.L. Salzberg","year":"1993","unstructured":"Salzberg, S.L.: C4.5: Programs for machine learning by j. ross quinlan. In: Machine Learning 1994, vol.\u00a016, pp. 235\u2013240. Morgan Kaufmann Publishers, Inc., San Francisco (1993), doi:10.1007\/BF00993309"},{"key":"36_CR19","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":"36_CR20","first-page":"721","volume-title":"Proceedings of the 2002 IEEE International Conference on Data Mining, ICDM 2002","author":"X. Yan","year":"2002","unstructured":"Yan, X., Han, J.: gspan: Graph-based substructure pattern mining. In: Proceedings of the 2002 IEEE International Conference on Data Mining, ICDM 2002, pages 721. IEEE Computer Society, Washington, DC (2002)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21458-5_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T08:04:48Z","timestamp":1560326688000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21458-5_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642214578","9783642214585"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21458-5_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}