Results 61 to 70 of about 102,063 (249)
Open Computer Science, 2020 In this paper, we study a well-known computationally hard problem, called the subgraph isomorphism problem where the goal is for a given pattern and target graphs to determine whether the pattern is a subgraph of the target graph. Numerous algorithms for
Mihelič Jurij, Čibej Uroš
doaj +1 more source
Inductive queries for a drug designing robot scientist [PDF]
, 2010 It is increasingly clear that machine learning algorithms need to be integrated in an iterative scientific discovery loop, in which data is queried repeatedly by means of inductive queries and where the computer provides guidance to the experiments that ...
A. Lingas +10 more
core +1 more source
Recursive-Parallel Algorithm for Solving the Maximum Common Subgraph Problem
Моделирование и анализ информационных систем, 2023 The paper proposes an algorithm for solving the problem of finding the maximum common subgraph. Both the sequential and the parallel version of the algorithm, their software implementation are described, and an experimental study of their effectiveness ...
Vladimir V. Vasilchikov
doaj +1 more source
On the Variable Ordering in Subgraph Isomorphism Algorithms
IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2017 Graphs are mathematical structures to model several biological data. Applications to analyze them require to apply solutions for the subgraph isomorphism problem, which is NP-complete. Here, we investigate the existing strategies to reduce the subgraph isomorphism algorithm running time with emphasis on the importance of the order with which the graph ...
Bonnici Vincenzo, Giugno Rosalba
openaire +5 more sources
Isomorphic subgraphs having minimal intersections [PDF]
Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics, 1983 AbstractGiven a finite graph H and G, a subgraph of it, we define σ (G, H) to be the largest integer such that every pair of subgraphs of H, both isomorphic to G, has at least σ(G, H) edges in common; furthermore, R(G, H) is defined to be the maximum number of subgraphs of H, all isomorphic to G, such that any two of them have σ(G, H) edges common ...
B. K. Roy +2 more
openaire +3 more sources
A Multi-Dimensional Matrix Product—A Natural Tool for Parameterized Graph Algorithms
Algorithms, 2022 We introduce the concept of a k-dimensional matrix product D of k matrices A1,…,Ak of sizes n1×n,…,nk×n, respectively, where D[i1,…,ik] is equal to ∑ℓ=1nA1[i1,ℓ]×…×Ak[ik,ℓ].
Mirosław Kowaluk, Andrzej Lingas
doaj +1 more source
Subgraph Isomorphism Meets Cutting Planes: Solving With Certified Solutions
International Joint Conference on Artificial Intelligence, 2020 Modern subgraph isomorphism solvers carry out sophisticated reasoning using graph invariants such as degree sequences and path counts. We show that all of this reasoning can be justified compactly using the cutting planes proofs studied in complexity ...
S. Gocht +2 more
semanticscholar +1 more source
Graphs with Isomorphic Neighbor-subgraphs
Taiwanese Journal of Mathematics, 2011 A graph $G$ is said to be $H$-regular if for each vertex $v\in V(G)$, the graph induced by $N_G(v)$ is isomorphic to $H$. A graph $H$ is a feasible neighbor-subgraph if there exists an H-regular graph, otherwise H is a forbidden neighbor-subgraph. In this paper, we obtain some classes of graphs $H$ which are forbidden and then we focus on searching $H$-
Chan, Chi-Feng +2 more
openaire +3 more sources
Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs [PDF]
, 2010 The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time [Bod90],[YBFT99].
Das, Bireswar +2 more
core +5 more sources
SICode: Embedding-Based Subgraph Isomorphism Identification for Bug Detection
IEEE International Conference on Program ComprehensionGiven a known buggy code snippet, searching for similar patterns in a target project to detect unknown bugs is a reasonable approach. In practice, a search unit, such as a function, may appear quite different from the buggy snippet but actually contains ...
Yuanjun Gong +6 more
semanticscholar +1 more source