Results 31 to 40 of about 21,959 (221)
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.
Gould, Ronald J., Rödl, Vojtech
openaire +1 more source
Filtering for subgraph isomorphism [PDF]
, 2007 A subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a filtering algorithm dedicated to this problem. The main idea is to label every node with respect to its relationships with other nodes of the graph, and to define a partial order on these labels in order to ...
Zampelli, Stephane +5 more
openaire +4 more sources
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
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
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
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