Time and Space Efficient Discovery of Maximal Geometric Graphs

A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scaling. While Kuramochi and Karypis (ICDM2002) extensively studied the frequent pattern mining problem for geometric subgraphs, the maximal graph mining has not been considered so far. In this paper, we study the maximal (or closed) graph mining problem for the general class of geometric graphs in the 2D plane by extending the framework of Kuramochi and Karypis. Combining techniques of canonical encoding and a depth-first search tree for the class of maximal patterns, we present a polynomial delay and polynomial space algorithm, MaxGeo, that enumerates all maximal subgraphs in a given input geometric graph without duplicates. This is the first result establishing the outputsensitive complexity of closed graph mining for geometric graphs. We also show that the frequent graph mining problem is also solvable in pol...

• Type: Conference
• Year: 2007
• Where: DIS
• Authors: Hiroki Arimura, Takeaki Uno, Shinichi Shimozono
• Keywords: DIS 2007, Geometric Graphs, Graph Mining, Graph Mining Problem, Theoretical Computer Science