Results 41 to 50 of about 102,063 (249)
Discrete Mathematics, 1993 This note is concerned with a question on the maximum possible \(s\) such that an arbitrary graph or hypergraph \(G\) contains a pair of edge disjoint isomorphic subgraphs of size \(s\). The authors investigate this question in the case of 3-uniform hypergraphs.
Vojtech Rödl, Ronald J. Gould
openaire +2 more sources
Partitioning the vertices of a torus into isomorphic subgraphs [PDF]
Journal of Combinatorial Theory, Series A, 2020 17 pages, 3 ...
Bonamy, M, Morrison, N, Scott, A
openaire +4 more sources
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
Research on the Top-Down Parsing Method for Context-Sensitive Graph Grammars. [PDF]
PLoS ONE, 2015 The parsing problem is one of the key problems of graph grammars. The typical parsing algorithm uses the bottom-up method. The time-complexity of this method is high, and it is difficult to apply.
Yi Wang, XiaoQin Zeng, Han Ding
doaj +1 more source
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
On highly regular strongly regular graphs [PDF]
, 2020 In this paper we unify several existing regularity conditions for graphs, including strong regularity, $k$-isoregularity, and the $t$-vertex condition. We develop an algebraic composition/decomposition theory of regularity conditions.
Pech, Christian
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
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
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
Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases [PDF]
, 2012 Many studies have been conducted on seeking the efficient solution for subgraph similarity search over certain (deterministic) graphs due to its wide application in many fields, including bioinformatics, social network analysis, and Resource Description ...
Chen, Lei +3 more
core +3 more sources