Frequent Submap Discovery

DOI10.1007/978-3-642-21458-5_36zbMath1339.68053OpenAlexW1764166390MaRDI QIDQ3011873

Stéphane Gosselin, Christine Solnon, Guillaume Damiand

Publication date: 29 June 2011

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Database theory (68P15) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Uses Software

• gSpan
• C4.5

Cites Work

• Efficient search of combinatorial maps using signatures
• Topological models for boundary representation: A comparison with \(n\)- dimensional generalized maps
• A Polynomial Algorithm for Submap Isomorphism
• N-DIMENSIONAL GENERALIZED COMBINATORIAL MAPS AND CELLULAR QUASI-MANIFOLDS
• A Census of Planar Maps
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Frequent Submap Discovery