Results 31 to 40 of about 1,396 (204)
GSI: GPU-friendly Subgraph Isomorphism [PDF]
2020 IEEE 36th International Conference on Data Engineering (ICDE), 2020 Subgraph isomorphism is a well-known NP-hard problem that is widely used in many applications, such as social network analysis and query over the knowledge graph. Due to the inherent hardness, its performance is often a bottleneck in various real-world applications.
Zeng, Li +4 more
openaire +2 more sources
An Algorithm for Subgraph Isomorphism [PDF]
Journal of the ACM, 1976 Subgraph isomorphism can be determined by means of a brute-force tree-search enumeration procedure. In this paper a new algorithm is introduced that attains efficiency by inferentially eliminating successor nodes in the tree search. To assess the time actually taken by the new algorithm, subgraph isomorphism, clique detection, graph isomorphism, and ...
openaire +2 more sources
Graphs with Isomorphic Neighbor-subgraphs
Taiwanese Journal of Mathematics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chan, Chi-Feng +2 more
openaire +3 more sources
Domination Numbers of Amalgamations of Cycles at Connected Subgraphs
Journal of Mathematics, 2022 A set S of vertices of a graph G is a dominating set of G if every vertex in VG is adjacent to some vertex in S. A minimum dominating set in a graph G is a dominating set of minimum cardinality.
Prakassawat Boonmee +2 more
doaj +1 more source
Computing and Drawing Isomorphic Subgraphs
Journal of Graph Algorithms and Applications, 2004 Summary: The isomorphic subgraph problem is finding two disjoint subgraphs of a graph which coincide on at least \(k\) edges. The graph is partitioned into a subgraph, its copy, and a remainder. The problem resembles the NP-hard largest common subgraph problem, which searches copies of a graph in a pair of graphs.
Bachl, S., Brandenburg, F.-J., Gmach, D.
openaire +1 more source
Approximate subgraph matching-based literature mining for biomedical events and relations. [PDF]
PLoS ONE, 2013 The biomedical text mining community has focused on developing techniques to automatically extract important relations between biological components and semantic events involving genes or proteins from literature.
Haibin Liu +3 more
doaj +1 more source
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 ...
Mullin, R. C. +2 more
openaire +2 more sources
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
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
Set-Centric Subgraph Isomorphism
, 2021 We investigate techniques for accelerating subgraph isomorphism (SI). SI is the task of finding occurrences of a pattern graph in a target graph and relevant to many practical applications. Our key idea is to use set algebra based formulations of SI.
openaire +2 more sources