A Polynomial Algorithm for Submap Isomorphism
From MaRDI portal
Publication:3637692
DOI10.1007/978-3-642-02124-4_11zbMath1248.68372MaRDI 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
68R10: Graph theory (including graph drawing) in computer science
68T10: Pattern recognition, speech recognition
68P05: Data structures
Related Items
Polynomial algorithms for open plane graph and subgraph isomorphisms, Efficient search of combinatorial maps using signatures, On the complexity of submap isomorphism and maximum common submap problems, Computing the Overlaps of Two Maps, Frequent Submap Discovery
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