Results 11 to 20 of about 1,956 (175)
DotMotif: an open-source tool for connectome subgraph isomorphism search and graph queries [PDF]
Scientific Reports, 2021 Recent advances in neuroscience have enabled the exploration of brain structure at the level of individual synaptic connections. These connectomics datasets continue to grow in size and complexity; methods to search for and identify interesting graph ...
Jordan K. Matelsky +6 more
doaj +2 more sources
A subgraph isomorphism algorithm and its application to biochemical data [PDF]
BMC Bioinformatics, 2012 Background: Graphs can represent biological networks at the molecular, protein, or species level. An important query is to find all matches of a pattern graph to a target graph.
Alfredo Ferro +9 more
core +2 more sources
Efficient Streaming Subgraph Isomorphism with Graph NeuralNetworks
, 2021 Queries to detect isomorphic subgraphs are important in graphbased data management. While the problem of subgraph isomorphism search has received considerable attention for the static setting of a single query, or a batch thereof, existing approaches do ...
Weidlich, Matthias +5 more
core +2 more sources
Between Subgraph Isomorphism and Maximum Common Subgraph [PDF]
, 2017 When a small pattern graph does not occur inside a larger target graph, we can ask how to find "as much of the pattern as possible" inside the target graph.
Mccreesh, Ciaran +2 more
core +2 more sources
SEARCH-TREE SIZE ESTIMATION FOR THE SUBGRAPH ISOMORPHISM PROBLEM [PDF]
Acta Electrotechnica et Informatica, 2019 This article addresses the problem of finding patterns in graphs. This is formally defined as the subgraph isomorphism problem and is one of the core problems in theoretical computer science. We consider the counting variation of this problem.
Uroš Čibej, Jurij MIHELIČ
doaj +1 more source
On the First-Order Complexity of Induced Subgraph Isomorphism [PDF]
Logical Methods in Computer Science, 2019 Given a graph $F$, let $I(F)$ be the class of graphs containing $F$ as an induced subgraph. Let $W[F]$ denote the minimum $k$ such that $I(F)$ is definable in $k$-variable first-order logic.
Oleg Verbitsky, Maksim Zhukovskii
doaj +1 more source
Recursive-Parallel Algorithm for Solving the Graph-Subgraph Isomorphism Problem
Моделирование и анализ информационных систем, 2022 The paper proposes a parallel algorithm for solving the Graph-Subgraph Isomorphism Problem and makes an experimental study of its efficiency. The problem is one of the most famous NP-complete problems.
Vladimir V. Vasilchikov
doaj +1 more source
Research on the Top-Down Parsing Method for Context-Sensitive Graph Grammars. [PDF]
PLoS ONE, 2015 The parsing problem is one of the key problems of graph grammars. The typical parsing algorithm uses the bottom-up method. The time-complexity of this method is high, and it is difficult to apply.
Yi Wang, XiaoQin Zeng, Han Ding
doaj +1 more source
Capturing Topology in Graph Pattern Matching [PDF]
, 2011 Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been considered instead.
Huai, Jinpeng +9 more
core +1 more source
An Optimization of Closed Frequent Subgraph Mining Algorithm
Cybernetics and Information Technologies, 2017 Graph mining isamajor area of interest within the field of data mining in recent years. Akey aspect of graph mining is frequent subgraph mining. Central to the entire discipline of frequent subgraph mining is the concept of subgraph isomorphism.
Demetrovics J. +3 more
doaj +1 more source