Results 51 to 60 of about 101,745 (269)
Graph theoretic methods for the analysis of structural relationships in biological macromolecules [PDF]
, 2005 Subgraph isomorphism and maximum common subgraph isomorphism algorithms from graph theory provide an effective and an efficient way of identifying structural relationships between biological macromolecules.
Altschul +72 more
core +3 more sources
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
Pattern matching and pattern discovery algorithms for protein topologies [PDF]
, 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 ...
C. Bron +14 more
core +1 more source
Two graph isomorphism polytopes [PDF]
, 2008 The convex hull $\psi_{n,n}$ of certain $(n!)^2$ tensors was considered recently in connection with graph isomorphism. We consider the convex hull $\psi_n$ of the $n!$ diagonals among these tensors. We show: 1. The polytope $\psi_n$ is a face of $\psi_{n,
Onn, Shmuel
core +3 more sources
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
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
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
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
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
Qubit Mapping Based on Subgraph Isomorphism and Filtered Depth-Limited Search [PDF]
IEEE transactions on computers, 2020 Mapping logical quantum circuits to Noisy Intermediate-Scale Quantum (NISQ) devices is a challenging problem which has attracted rapidly increasing interests from both quantum and classical computing communities. This article proposes an efficient method
Sanjiang Li, Xiang-Yu Zhou, Yuan Feng
semanticscholar +1 more source