Results 81 to 90 of about 1,956 (175)
Subgraph Isomorphism in Polynomial Time
, 1995 In this paper, we propose a new approach to the problem of subgraph isomorphism detection. The new method is designed for systems which differentiate between graphs that are a priori known, so-called model graphs, and unknown graphs, so-called input ...
B. T. Messmer, H. Bunke
core
Subgraph isomorphism in planar graphs and related problems [PDF]
, 1994 We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph into pieces of small tree-width, and applying dynamic programming within ...
Eppstein, David
core
Symmetry breaking in the subgraph isomorphism problem [PDF]
The Subgraph Isomorphism Problem has many applications, including bioinformatics, computer vision and graph databases. Current state-of-the-art solvers using constraints programming techniques can handle cases with up to 1000 pattern vertices and 10,000 ...
Loughney, Joseph Patrick, Hoffmann, Ruth
core +1 more source
A constraint programming approach to subgraph isomorphism
, 2008 This thesis proposes an expressive yet efficient declarative framework for graph matching in constraint programming (CP), and focuses on efficient algorithms to solve the subgraph isomorphism problem.
Zampelli, Stéphane
core
Filtering for Subgraph Isomorphism
, 2008 . 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.
Villeurbanne Cedex (france +4 more
core
Solving subgraph isomorphism problems with constraint programming
, 2010 The 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 global constraint and an associated filtering algorithm to solve this problem within the context of constraint
Solnon, Christine +2 more
core +1 more source
An Efficient Implementation of a Subgraph Isomorphism Algorithm for GPUs. [PDF]
, 2019 The subgraph isomorphism problem is a computational task that applies to a wide range of today's applications, ranging from the understanding of biological networks to the analysis of social networks.
Giugno R, Bonnici V, Bombieri N
core +1 more source
MathematicsIn recent years, with the rapid development of the Internet of Things, large-scale botnet attacks have occurred frequently and have become an important challenge to network security.
Lihua Yin +3 more
doaj +1 more source
Homology analysis of malware based on graph
Tongxin xuebao, 2017 Malware detection and homology analysis has been the hotspot of malware analysis.API call graph of malware can represent the behavior of it.Because of the subgraph isomorphism algorithm has high complexity,the analysis of malware based on the graph ...
Bing-lin ZHAO +4 more
doaj +2 more sources
Subgraph error-correcting isomorphism for syntactic pattern recognition
, 2009 [[abstract]]The structure-preserved error-correcting graph isomorphism proposed by Tsai and Fu for matching patterns represented by attributed relational graphs is extended to the case of subgraphs.
W. H. Tsai;K. S. Fu
core