Two combinatorial maps M1 and M2 overlap if they share a sub-map, called an overlapping pattern, which can be extended without conflicting neither with M1 nor with M2. Isomorphism and subisomorphism are two particular cases of map overlaps which have been studied in the literature. In this paper, we show that finding the largest connected overlap between two combinatorial maps is tractable in polynomial time. On the other hand, without the connectivity constraint, the problem is NP-hard. To obtain the positive results we exploit the properties of a product map.
CITATION STYLE
Janodet, J. C., & de la Higuera, C. (2016). Computing the overlaps of two maps. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9667, pp. 65–76). Springer Verlag. https://doi.org/10.1007/978-3-319-39441-1_7
Mendeley helps you to discover research relevant for your work.