On the complexity of Submap Isomorphism - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

On the complexity of Submap Isomorphism


Generalized maps describe the subdivision of objects in cells, and incidence and adjacency relations between cells, and they are widely used to model 2D and 3D images. Recently, we have defined submap isomorphism, which involves deciding if a copy of a pattern map may be found in a target map, and we have described a polynomial time algorithm for solving this problem when the pattern map is connected. In this paper, we show that submap isomorphism becomes NP-complete when the pattern map is not connected, by reducing the NP-complete problem Planar-4 3-SAT to it.
Fichier principal
Vignette du fichier
complexitySubmapIso.pdf (381.02 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00825794 , version 1 (24-05-2013)



Christine Solnon, Guillaume Damiand, Colin de La Higuera, Jean-Christophe Janodet. On the complexity of Submap Isomorphism. Graph-Based Representation in Pattern Recognition, May 2013, Vienna, Austria. pp.21-30, ⟨10.1007/978-3-642-38221-5_3⟩. ⟨hal-00825794⟩
377 View
445 Download



Gmail Facebook Twitter LinkedIn More