Results 41 to 50 of about 21,959 (221)
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
Towards an Isomorphism Dichotomy for Hereditary Graph Classes [PDF]
, 2014 In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the graph classes characterized by two forbidden induced subgraphs.
Schweitzer, Pascal
core +3 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 ...
Mullin, R. C. +2 more
openaire +2 more sources
Performance and scalability of indexed subgraph query processing methods [PDF]
, 2015 Graph data management systems have become very popular as graphs are the natural data model for many applications. One of the main problems addressed by these systems is subgraph query processing; i.e., given a query graph, return all graphs that ...
Katsarou, Foteini +2 more
core +1 more source
Graph Homomorphism Revisited for Graph Matching [PDF]
, 2010 In a variety of emerging applications one needs to decide whether a graph G matches another G p , i.e. , whether G
Fan, Wenfei +4 more
core +1 more source
Mining Frequent Neighborhood Patterns in Large Labeled Graphs [PDF]
, 2013 Over the years, frequent subgraphs have been an important sort of targeted patterns in the pattern mining literatures, where most works deal with databases holding a number of graph transactions, e.g., chemical structures of compounds. These methods rely
Han, Jialong, Wen, Ji-Rong
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
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