On the Complexity of Submap Isomorphism

DOI10.1007/978-3-642-38221-5_3zbMath1382.68211OpenAlexW33337896MaRDI QIDQ4922143

Jean-Christophe Janodet, Colin de la Higuera, Christine Solnon, Guillaume Damiand

Publication date: 28 May 2013

Published in: Graph-Based Representations in Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38221-5_3

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Pattern recognition, speech recognition (68T10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

On the complexity of submap isomorphism and maximum common submap problems ⋮ Computing the Overlaps of Two Maps

This page was built for publication: On the Complexity of Submap Isomorphism