Skip to Main content Skip to Navigation
Conference papers

On the complexity of Submap Isomorphism

Abstract : 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.
Complete list of metadata

Cited literature [9 references]  Display  Hide  Download
Contributor : Guillaume Damiand Connect in order to contact the contributor
Submitted on : Friday, May 24, 2013 - 3:46:06 PM
Last modification on : Wednesday, April 27, 2022 - 3:44:01 AM
Long-term archiving on: : Tuesday, April 4, 2017 - 11:17:38 AM


Files produced by the author(s)



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⟩



Record views


Files downloads