On the complexity of submap isomorphism

DOI10.1007/978-3-642-38221-5_3zbMATH Open1382.68211OpenAlexW33337896MaRDI QIDQ4922143FDOQ4922143

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

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

Recommendations

• On the complexity of submap isomorphism and maximum common submap problems
• A Polynomial Algorithm for Submap Isomorphism
• Polynomial algorithms for open plane graph and subgraph isomorphisms
• Computing the overlaps of two maps
• Subgraph Isomorphism in Planar Graphs and Related Problems

Mathematics Subject Classification ID

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

Cited In (5)

• Measuring the distance of generalized maps
• Frequent submap discovery
• On the complexity of submap isomorphism and maximum common submap problems
• A Polynomial Algorithm for Submap Isomorphism
• Computing the Overlaps of Two Maps

This page was built for publication: On the complexity of submap isomorphism

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4922143)