Results 81 to 90 of about 17,360 (200)
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
Network Evolution With Mesoscopic Delays
Random Structures &Algorithms, Volume 67, Issue 2, September 2025.ABSTRACT Owing to the influence of real‐world networks both in science and society, numerous mathematical models have been developed to understand the structure and evolution of these systems, particularly in a temporal context. Recent advancements in fields like distributed cyber‐security and social networks have spurred the creation of probabilistic ...
Sayan Banerjee +3 more
wiley +1 more source
OrbitSI: An Orbit-based algorithm for the subgraph isomorphism search problem
2024 IEEE International Conference on Knowledge Graph (ICKG)The Subgraph Isomorphism (SI) search problem searches for embeddings of a pattern graph within a data graph. Efficient heuristic algorithms for the SI search problem are often structured around a Depth-First Search (DFS) tree-based search to find matching subgraphs.
Tauhidi, Syed +3 more
openaire +4 more sources
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
Homomorphic Preimages of Geometric Cycles
, 2015 A graph G is a homomorphic preimage of another graph H, or equivalently G is H-colorable, if there exists a graph homomorphism from G to H. A classic problem is to characterize the family of homomorphic preimages of a given graph H.
Cockburn, Sally
core
, 1987 We consider the problems of subgraph homeomorphism with fixed pattern graph, recognition, and subgraph isomorphism for some classes of planar graphs. Following the results of Robertson and Seymour on forbidden minor characterization, we show that the problems of fixed subgraph homeomorphism and recognition for any family of planar graphs closed under ...
Lingas, Andrzej, Proskurowski, Andrzej
openaire +1 more source
Empirical Analysis of Common Subgraph Isomorphism Approaches to the Lost-in-Space Star Identification Problem [PDF]
, 2018 Glenn Galvizo, Lipyeow Lim
openalex +1 more source
Integration of subgraph isomorphism problem into ALGator system
, 2015 This thesis deals with a subgraph isomorphism problem and its integration into ALGator system. Detection of isomorphic subgraph is present in many scientific fields nowadays, therefore new problem solving algorithms constantly appear. We focus on a detailed description of Ullmann algorithm, improved Ullmann algorithm and RI algorithm, the most recent
openaire +1 more source
Speeding up the Detection of Adsorbate Lateral Interactions in Graph-Theoretical Kinetic Monte Carlo Simulations. [PDF]
J Phys Chem A, 2023 Benson RL, Yadavalli SS, Stamatakis M.
europepmc +1 more source