P. Lienhardt, N-DIMENSIONAL GENERALIZED COMBINATORIAL MAPS AND CELLULAR QUASI-MANIFOLDS, International Journal of Computational Geometry & Applications, vol.04, issue.03, pp.275-324, 1994.
DOI : 10.1142/S0218195994000173

D. Fradin, D. Meneveaux, and P. Lienhardt, A Hierarchical Topology-Based Model for Handling Complex Indoor Scenes, Computer Graphics Forum, vol.21, issue.8, pp.149-162, 2006.
DOI : 10.1145/882262.882324
URL : https://hal.archives-ouvertes.fr/hal-00332648

J. P. Braquelaire and L. Brun, Image Segmentation with Topological Maps and Inter-pixel Representation, Journal of Visual Communication and Image Representation, vol.9, issue.1, pp.62-79, 1998.
DOI : 10.1006/jvci.1998.0374

G. Damiand, C. De-la-higuera, J. C. Janodet, E. Samuel, and C. Solnon, A Polynomial Algorithm for Submap Isomorphism, In: GbR. LNCS, vol.15, issue.4, pp.102-112, 2009.
DOI : 10.1007/978-3-540-74970-7_51

G. Damiand, C. Solnon, C. De-la-higuera, J. C. Janodet, and E. Samuel, Polynomial algorithms for subisomorphism of nD open combinatorial maps, Computer Vision and Image Understanding, vol.115, issue.7, pp.996-1010, 2011.
DOI : 10.1016/j.cviu.2010.12.013
URL : https://hal.archives-ouvertes.fr/hal-00597483

C. Combier, G. Damiand, and C. Solnon, From maximum common submaps to edit distances of generalized maps, Pattern Recognition Letters, vol.33, issue.15, pp.2020-2028, 2012.
DOI : 10.1016/j.patrec.2012.04.006
URL : https://hal.archives-ouvertes.fr/hal-00735005

K. Jansen and H. Müller, The minimum broadcast time problem for several processor networks, Theoretical Computer Science, vol.147, issue.1-2, pp.69-85, 1995.
DOI : 10.1016/0304-3975(94)00230-G

B. Mohar, A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface, SIAM Journal on Discrete Mathematics, vol.12, issue.1, pp.6-26, 1999.
DOI : 10.1137/S089548019529248X

C. Combier, G. Damiand, and C. Solnon, Measuring the Distance of Generalized Maps, GbR, pp.82-91, 2011.
DOI : 10.1007/978-3-642-20844-7_9
URL : https://hal.archives-ouvertes.fr/hal-00595088