Results 101 to 110 of about 1,396 (204)

New Subgraph Isomorphism Algorithms: Vertex versus Path-at-a-time Matching [PDF]

, 2019
Mosab Hassaan, Karam Gouda
openalex   +1 more source

Optimized Backtracking for Subgraph Isomorphism

International Journal of Database Management Systems, 2012
Subgraph isomorphism is a fundamental graph problem with many important applications. Given two graphs G and SG, the subgraph isomorphism problem is to determine whether G contains a subgraph that is isomorphic to SG. It is well known that the problem is NP complete in the worst case.
openaire   +1 more source

Random Generation Topology Coding Technique in Asymmetric Topology Encryption

Mathematics
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

Subgraph Isomorphism Search in Massive Graph Databases

, 2016
Chemseddine Nabti, Hamida Seba
openalex   +1 more source

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., Holliday, J.D., Willett, P.   +2 more
openaire  

The subgraph isomorphism problem

, 2013
This thesis describes the problem of finding subgraph isomorphism. This is one of the most basic operations performed on graphs and is an NP-hard problem. We describe in detail the Ullmann algorithm and VF2 algorithm, the most commonly used and state-of-the art algorithms in this field, and a new algorithm called Subsea.
openaire   +1 more source

Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism [PDF]

, 2010
J. R. Ullmann
openalex   +1 more source

Searching for Similar Subgraphs in an Unweighted Undirected Graph by Computing Isomorphic Path Sets

Современные информационные технологии и IT-образование
The topic of subgraph search in a supergraph remains relevant and fundamental. Graphs are highly successful models for both visualization and handling complex relationships, such as those represented in semantic networks or even source code of programs ...
Valentin Sysoev, Aleksandr Bykov
doaj   +1 more source

Multi-Task Prediction Method Based on GGCN for Object Centric Event Logs

IEEE Access
Event logs constitute the fundamental data for predictive process monitoring research, and the quality and format of these logs are crucial for predictive analysis.
Li Ke, Fang Huan, Xu Yifei, Shao Chifeng
doaj   +1 more source

Uncertainty-aware efficient subgraph isomorphism using graph topology

Pattern Recognition
Subgraph isomorphism, also known as subgraph matching, is typically regarded as an NP-complete problem. This complexity is further compounded in practical applications where edge weights are real-valued and may be affected by measurement noise and potential missing data.
Arpan Kusari, Wenbo Sun
openaire   +2 more sources