Results 91 to 100 of about 55,019 (192)
A Relational view of subgraph isomorphism
This paper presents a novel approach to the problem of finding all subgraph isomorphisms of a (pattern) graph into another (target) graph. A relational formulation of the problem, combined with a representation of relations and graphs by Boolean functions, allows to handle the combinatorial explosion in the case of small pattern graphs and large target
Cortadella, Jordi +1 more
openaire +2 more sources
In 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
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
Node Embedding and Cosine Similarity for Efficient Maximum Common Subgraph Discovery
Finding the maximum common induced subgraph is a fundamental problem in computer science. Proven to be NP-hard in the 1970s, it has, nowadays, countless applications that still motivate the search for efficient algorithms and practical heuristics.
Stefano Quer +4 more
doaj +1 more source
Improved VF2 Algorithm for Notch Feature Recognition Based on MCF
Building upon existing methods for three-dimensional geometric rule recognition, this paper proposes a sealed-cavity notch feature recognition algorithm based on an attributed adjacency graph (AAG).
GUO Xifeng +4 more
doaj +1 more source
Symmetry Breaking in Subgraph Isomorphism
The present work studies symmetry breaking for the subgraph isomorphism problem. This NP-Complete problem decides if a pattern graph is isomorphic to a subgraph of a target graph. The first part of the paper shows how to detect and break all variable and
Deville, Yves +4 more
core
Fast and Accurate Efficient Streaming Subgraph Isomorphism [PDF]
Queries to detect isomorphic subgraphs are important in graph-based data management. While the problem of subgraph isomorphism search has received considerable attention for the static setting of a single query, or a batch thereof, existing approaches do
Weidlich, Matthias +5 more
core
Subgraph Isomorphism in Polynomial Time
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
A constraint programming approach to subgraph isomorphism
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
Random Generation Topology Coding Technique in Asymmetric Topology Encryption
The security of traditional public key cryptography algorithms depends on the difficulty of the underlying mathematical problems. Asymmetric topological encryption is a graph-dependent encryption algorithm produced to resist attacks by quantum computers ...
Jing Su, Bing Yao
doaj +1 more source

