A Polynomial Algorithm for Submap Isomorphism

DOI10.1007/978-3-642-02124-4_11zbMath1248.68372OpenAlexW1605044740MaRDI QIDQ3637692

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

Publication date: 14 July 2009

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-02124-4_11

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10) Data structures (68P05)

Related Items (5)

On the complexity of submap isomorphism and maximum common submap problems ⋮ Polynomial algorithms for open plane graph and subgraph isomorphisms ⋮ Efficient search of combinatorial maps using signatures ⋮ Frequent Submap Discovery ⋮ Computing the Overlaps of Two Maps

Cites Work

• Unnamed Item
• Unnamed Item
• A parametric filtering algorithm for the graph isomorphism problem
• Topological models for boundary representation: A comparison with \(n\)- dimensional generalized maps
• Spectral embedding of graphs.
• Filtering for Subgraph Isomorphism
• N-DIMENSIONAL GENERALIZED COMBINATORIAL MAPS AND CELLULAR QUASI-MANIFOLDS
• A Census of Planar Maps

This page was built for publication: A Polynomial Algorithm for Submap Isomorphism