大規模幾何データからの高速な極大部分グラフ発見 -国情報学研究所.pptVIP

ILP05, Aug 2005, Hiroki Arimura, Hokkaido University * Intersection of geometric graphs Lemma: The intersection of geographsT1 and T2 is the unique geograph Merge(T1, T2) = T whose object sets is given by α(T) = α(T1)∩α(T2). Merge(T1, T2) T2 T1 α(T1) α(T2) α(Merge(T1, T2)) α(G) = The object set of G, that is, the set of all labeled vertices and labeled edges in a geometric graph G Closure of geograph The intersection Merge(P1, P2) of a pair of geographs P1 and P2 The intersection of P1 and P2 as the first order (relational) structure The closure of geograph P Closure(P) = Merge(L(P)) Theorem: P is maximal in D iff CLosure(P) = P 要修正！ Tree-shaped search route for maximal patterns The core of (the code of) a geograph P The shortest prefix core(P) of code(P) such that L(P) = L(core(P)) The parent P of maximal geograph Q Parent(P) = Closure(the proper prefix of core(the code of P)) Theorem: The graph Tree(Geo) = (Geo, Parent(.)) forms a spanning tree for Geo with the empty geograph as root 要修正！ ILP05, Aug 2005, Hiroki Arimura, Hokkaido University * Our algorithm MaxGeo: Basic Idea Tree(Geo) = (Geo, Parent(.)) Depth-first search over a tree-shaped search space for all maximal gegraphs Jumping from one maximal geograph to another maximal geograph Main result Theorem: Given an input geometric graph D, algorithm MaxGeo enumerates all frequent maximal pattern P in M without duplicates in O(m(m+n)||D||2 log ||D||) = O(n8 log n) time per pattern and in O(m) = O(n2) space, with the maximum number m of occurrences of a pattern other than trivial patterns, the number n of vertices in D, and the number ||D|| of vertices and edges in D. Corollary: The maximal pattern enumeration problem is solvable in polynomial delay and polynomial space in the total input size. Summary: We develop techniques... A polynomial time computable canonical code for all geometric graphs which is invariant under geometric transformations. Characterization of M by the intersection operati