• gSpan

  • Referenced in 108 articles [sw11908]
  • first search strategy to mine frequent connected subgraphs efficiently. Our performance study shows that gSpan...
  • MaxCliqueDyn

  • Referenced in 33 articles [sw08507]
  • Konc. A clique is a fully connected subgraph of a graph and a maximum clique...
  • MOLGEN

  • Referenced in 26 articles [sw00586]
  • vertices and forbidden or prescribed sets of subgraphs (algorithm MOLGEN).par The algorithm relies...
  • AFGen

  • Referenced in 15 articles [sw06325]
  • different types of topologies: paths (PF), acyclic subgraphs (AF), and arbitrary topology subgraphs (GF). This...
  • Fg-index

  • Referenced in 9 articles [sw18892]
  • graph databases is costly since it involves subgraph isomorphism testing, which is an NP-complete ... perform verification on each candidate by checking subgraph isomorphism. Query performance is improved since ... number of subgraph isomorphism tests is reduced. However, candidate verification is still inevitable, which ... index, based on the set of Frequent subGraphs (FGs). Given a graph query that...
  • TABARIS

  • Referenced in 16 articles [sw02534]
  • bounds on the independence number of a subgraph. These are obtained by applying an adaptation...
  • BiNGO

  • Referenced in 14 articles [sw13896]
  • genes, pasted as text, or interactively on subgraphs of biological networks visualized in Cytoscape. BiNGO...
  • LPG

  • Referenced in 12 articles [sw20690]
  • consists of ”action graphs”, particular subgraphs of the planning graph representing partial plans. The search...
  • SING

  • Referenced in 5 articles [sw18904]
  • SING: Subgraph search In Non-homogeneous Graphs. Background: Finding the subgraphs of a graph database ... fields, from cheminformatics to image understanding. Since subgraph isomorphism is a computationally hard problem, indexing ... cannot contain the query, and apply a subgraph isomorphism algorithm to each residual candidate graph ... large graphs. Results: In this paper, SING (Subgraph search In Non-homogeneous Graphs), a novel...
  • GraphGrep

  • Referenced in 10 articles [sw18891]
  • graphs, finding all the occurrences of a subgraph in a database of graphs. The interface...
  • GraphX

  • Referenced in 9 articles [sw15432]
  • exposes a set of fundamental operators (e.g., subgraph, joinVertices, and aggregateMessages) as well...
  • SAPPER

  • Referenced in 5 articles [sw18894]
  • SAPPER: subgraph indexing and approximate matching in large graphs. With the emergence of new applications ... graph, we investigate the problem of approximate subgraph indexing, i.e., finding the occurrences ... efficiency and scalability of our approximate subgraph indexing method...
  • MotifCut

  • Referenced in 5 articles [sw35400]
  • MotifCut: regulatory motifs finding with maximum density subgraphs. Results: We present MotifCut, a graph-theoretic ... motif as the maximum density subgraph, which is a set of k-mers that exhibit ... between position pairs are found as dense subgraphs. We benchmark MotifCut on both synthetic...
  • Anchor-PROMPT

  • Referenced in 8 articles [sw09802]
  • algorithm analyzes the paths in the subgraph limited by the anchors and determines which classes...
  • TopoLayout

  • Referenced in 7 articles [sw11876]
  • detected recursively inside the graph, and their subgraphs are collapsed into single nodes, forming...
  • NeMa

  • Referenced in 4 articles [sw18899]
  • propose NeMa (Network Match), a neighborhood-based subgraph matching technique for querying real-life networks ... match, we propose a novel subgraph matching cost metric that aggregates the costs of matching ... metric, we formulate the minimum cost subgraph matching problem. Given a query graph...
  • GADDI

  • Referenced in 6 articles [sw18895]
  • GADDI: distance index based subgraph matching in biological networks. Currently, a huge amount of biological...
  • SAGA

  • Referenced in 6 articles [sw18905]
  • SAGA: a subgraph matching tool for biological graphs. Motivation: With the rapid increase...