Results 21 to 30 of about 1,956 (175)
SING: Subgraph search In Non-homogeneous Graphs
BMC Bioinformatics, 2010 Background Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image understanding.
Pulvirenti Alfredo +5 more
doaj +1 more source
On Minimal Unique Induced Subgraph Queries
Applied Sciences, 2018 In this paper, a novel type of interesting subgraph query is proposed: Minimal Unique Induced Subgraph (MUIS) query. Given a (large) graph G and a query vertex (position) q in the graph, can we find an induced subgraph containing q with the minimal ...
Lincheng Jiang +6 more
doaj +1 more source
The search for minimal edge 1-extension of an undirected colored graph [PDF]
Известия Саратовского университета. Новая серия: Математика. Механика. Информатика, 2021 Let $G=(V, \alpha, f)$ be a colored graph with a coloring function $f$ defined on its vertices set $V$. Colored graph $G^*$ is an edge $1$-extension of a colored graph $G$ if $G$ could be included into each subgraph taking into consideration the colors ...
Razumovsky, Peter Vladimirovich
doaj +1 more source
Planar Subgraph Isomorphism Revisited [PDF]
, 2010 The problem of {\sc Subgraph Isomorphism} is defined as follows: Given a \emph{pattern} $H$ and a \emph{host graph} $G$ on $n$ vertices, does $G$ contain a subgraph that is isomorphic to $H$?
Dorn, Frederic
core +1 more source
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
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
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
Neural Subgraph Isomorphism Counting
, 2020 In this paper, we study a new graph learning problem: learning to count subgraph isomorphisms. Different from other traditional graph learning problems such as node classification and link prediction, subgraph isomorphism counting is NP-complete and ...
Jiang, Xin +11 more
core +1 more source
Pattern matching and pattern discovery algorithms for protein topologies
, 2001 We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgraph isomorphism and finding maximal common subgraphs in a restricted ...
Viksna, J +3 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