Results 111 to 120 of about 21,959 (221)
On the Variable Ordering in Subgraph Isomorphism Algorithms
IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2017 Graphs are mathematical structures to model several biological data. Applications to analyze them require to apply solutions for the subgraph isomorphism problem, which is NP-complete. Here, we investigate the existing strategies to reduce the subgraph isomorphism algorithm running time with emphasis on the importance of the order with which the graph ...
Bonnici Vincenzo, Giugno Rosalba
openaire +4 more sources
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
New Subgraph Isomorphism Algorithms: Vertex versus Path-at-a-time Matching [PDF]
, 2019 Mosab Hassaan, Karam Gouda
openalex +1 more source
Node Embedding and Cosine Similarity for Efficient Maximum Common Subgraph Discovery
Applied SciencesFinding 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
Beating Treewidth for Average-Case Subgraph Isomorphism [PDF]
, 2019 Gregory Rosenthal
openalex +1 more source
Subgraph Isomorphism: Prolog vs. Conventional
Subgraph Isomorphism uses a small graph as a pattern to identify within a larger graph a set of vertices that have matching edges. This paper addresses a logic program written in Prolog for a specific relatively complex graph pattern for which multiple conventional implementations (including parallel) exist.
Yin, Claire Y., Kogge, Peter M.
openaire +2 more sources
Random Generation Topology Coding Technique in Asymmetric Topology Encryption
MathematicsThe 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
Improving Graph Neural Network Expressivity via Subgraph Isomorphism Counting [PDF]
, 2022 Giorgos Bouritsas +3 more
openalex +1 more source
On the complexity of various parameterizations of common induced subgraph isomorphism
, 2017 Faisal N. Abu-Khzam +2 more
openalex +2 more sources
Maximum Common Subgraph Isomorphism Algorithms [PDF]
, 2017 Maximum common subgraph (MCS) isomorphism algorithms play an important role in chemoinformatics by providing an effective mechanism for the alignment of pairs of chemical structures. This article discusses the various types of MCS that can be identified when two graphs are compared and reviews some of the algorithms that are available for this purpose,
Duesbury, E. +2 more
openaire