Jan 26, 2010 · In this paper, we consider the class of outerplanar graphs, a strict generalization of trees, develop a frequent subgraph mining algorithm for outerplanar ...
scholar.google.com › citations
In this paper, we define the class of so called tenuous outerplanar graphs, a strict generalization of trees, develop a frequent subgraph mining algorithm for ...
We develop an incrmental polynomial time algorithm for enumerating frequent tenuous outerplanar graph patterns. Our approach is based on a canonical string ...
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the.
We develop a levelwise search algorithm [27] for listing frequent connected outerplanar graph patterns with respect to a constrained subgraph isomorphism.
Oct 22, 2024 · The frequent connected subgraph mining problem, i.e., the problem of listing all connected graphs that are subgraph isomorphic to at least a ...
In this paper, we consider the class of outerplanar graphs, a strict generalization of trees, develop a frequent subgraph mining algorithm for outerplanar ...
... outerplanar graphs, a strict general- ization of trees, develop a frequent subgraph mining algorithm for tenuous outerplanar graphs that works in ...
In this paper, we define the class of so called tenuous outerplanar graphs, a strict generalization of trees, develop a frequent subgraph mining algorithm for ...
In this paper, we consider the class of outerplanar graphs, a strict generalization of trees, develop a frequent subgraph mining algorithm for outerplanar ...