Frequent submap discovery

DOI10.1007/978-3-642-21458-5_36MaRDI QIDQ3011873zbMATH OpenOpenAlexFDO

Authors Stéphane Gosselin, Guillaume Damiand, Christine Solnon

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

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

Recommendations

• A Polynomial Algorithm for Submap Isomorphism
• On the complexity of submap isomorphism and maximum common submap problems
• On the complexity of submap isomorphism
• Efficient search of combinatorial maps using signatures
• The Complexity of Mining Maximal Frequent Subgraphs

Cites work

• scientific article; zbMATH DE number 3489159 (Why is no real title available?)
• scientific article; zbMATH DE number 3338383 (Why is no real title available?)
• A Census of Planar Maps
• A Polynomial Algorithm for Submap Isomorphism
• Efficient search of combinatorial maps using signatures
• Frequent subtree mining -- an overview
• N-DIMENSIONAL GENERALIZED COMBINATORIAL MAPS AND CELLULAR QUASI-MANIFOLDS
• Topological models for boundary representation: A comparison with \(n\)- dimensional generalized maps

Cited in

(2)

• Efficient search of combinatorial maps using signatures
• A Polynomial Algorithm for Submap Isomorphism

Describes a project that uses

Uses Software

• C4.5
• gSpan

This page was built for publication: Frequent submap discovery

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