Results 31 to 40 of about 17,360 (200)

An Optimization of Closed Frequent Subgraph Mining Algorithm

open access: yesCybernetics 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

Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask) [PDF]

open access: yes, 2013
Given two graphs H and G, the Subgraph Isomorphism problem asks if H is isomorphic to a subgraph of G. While NP-hard in general, algorithms exist for various parameterized versions of the problem.
Marx, Dániel, Pilipczuk, Michal
core   +4 more sources

SING: Subgraph search In Non-homogeneous Graphs

open access: yesBMC 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

An experimental evaluation of refinement techniques for the subgraph isomorphism backtracking algorithms

open access: yesOpen 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

On Minimal Unique Induced Subgraph Queries

open access: yesApplied 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

Inferring local topology via variational convolution for graph representation

open access: yes工程科学学报, 2023
The development of deep learning techniques and support of big data computing power have revolutionized graph representation research by facilitating the implementation of the learning of different graph neural network structures.
Jingyi HOU   +3 more
doaj   +1 more source

Quantum Query Complexity of Subgraph Isomorphism and Homomorphism [PDF]

open access: yes, 2015
Let $H$ be a fixed graph on $n$ vertices. Let $f_H(G) = 1$ iff the input graph $G$ on $n$ vertices contains $H$ as a (not necessarily induced) subgraph. Let $\alpha_H$ denote the cardinality of a maximum independent set of $H$. In this paper we show: \[
Kulkarni, Raghav, Podder, Supartha
core   +2 more sources

On the First-Order Complexity of Induced Subgraph Isomorphism [PDF]

open access: yesLogical Methods in Computer Science, 2019
Given a graph $F$, let $I(F)$ be the class of graphs containing $F$ as an induced subgraph. Let $W[F]$ denote the minimum $k$ such that $I(F)$ is definable in $k$-variable first-order logic.
Oleg Verbitsky, Maksim Zhukovskii
doaj   +1 more source

Towards an Isomorphism Dichotomy for Hereditary Graph Classes [PDF]

open access: yes, 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

FS^3: A Sampling based method for top-k Frequent Subgraph Mining [PDF]

open access: yes, 2014
Mining labeled subgraph is a popular research task in data mining because of its potential application in many different scientific domains. All the existing methods for this task explicitly or implicitly solve the subgraph isomorphism task which is ...
Hasan, Mohammad Al, Saha, Tanay Kumar
core   +3 more sources

Home - About - Disclaimer - Privacy