Results 121 to 130 of about 21,959 (221)
The subgraph isomorphism problem
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
Searching for Similar Subgraphs in an Unweighted Undirected Graph by Computing Isomorphic Path Sets
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
Detection of large exact subgraph isomorphisms with a topology-only graphlet index built using deterministic walks [PDF]
Patrick Wang, Henry Ye, Wayne Hayes
openalex +1 more source
Multi-Task Prediction Method Based on GGCN for Object Centric Event Logs
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
Subgraph Isomorphism Search in Massive Graph Databases
Chemseddine Nabti, Hamida Seba
openalex +1 more source
Affine maps between quadratic assignment polytopes and subgraph\n isomorphism polytopes [PDF]
А. А. Максименко
openalex +1 more source
A subgraph isomorphism algorithm and its application to biochemical data. [PDF]
Bonnici V +4 more
europepmc +1 more source
Subgraph Isomorphism on Graph Classes that Exclude a Substructure
Hans L. Bodlaender +6 more
openalex +2 more sources

