Results 51 to 60 of about 102,063 (249)
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
Portfolios of Subgraph Isomorphism Algorithms [PDF]
, 2016 Subgraph isomorphism is a computationally challenging problem with\ud important practical applications, for example in computer vision, biochemistry,\ud and model checking. There are a number of state-of-the-art algorithms for solving\ud the problem, each of which has its own performance characteristics.
Kotthoff, Lars +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
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
Static graph challenge: Subgraph isomorphism [PDF]
2017 IEEE High Performance Extreme Computing Conference (HPEC), 2017 The rise of graph analytic systems has created a need for ways to measure and compare the capabilities of these systems. Graph analytics present unique scalability difficulties. The machine learning, high performance computing, and visual analytics communities have wrestled with these difficulties for decades and developed methodologies for creating ...
Albert Reuther +11 more
openaire +4 more sources
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
IEICE Trans. Inf. Syst., 2021 SUMMARY Ising machines have attracted attention as they are expected to solve combinatorial optimization problems at high speed with Ising models corresponding to those problems.
Natsuhito Yoshimura +6 more
semanticscholar +1 more source
Subgraph isomorphism in graph classes
Discrete Mathematics, 2012 AbstractWe investigate the computational complexity of the following restricted variant of Subgraph Isomorphism: given a pair of connected graphs G=(VG,EG) and H=(VH,EH), determine if H is isomorphic to a spanning subgraph of G. The problem is NP-complete in general, and thus we consider cases where G and H belong to the same graph class such as the ...
Yota Otachi +3 more
openaire +1 more source
Towards an Isomorphism Dichotomy for Hereditary Graph Classes [PDF]
, 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