Results 61 to 70 of about 23,139 (195)
The Generic Circular Triangle‐Free Graph
Journal of Graph Theory, Volume 109, Issue 4, Page 426-445, August 2025.ABSTRACT In this article, we introduce the generic circular triangle‐free graph C 3 and propose a finite axiomatization of its first‐order theory. In particular, our main results show that a countable graph G embeds into C 3 if and only if it is a { K 3 , K 1 + 2 K 2 , K 1 + C 5 , C 6 }‐free graph.
Manuel Bodirsky, Santiago Guzmán‐Pro
wiley +1 more source
Intelligent Medical Diagnosis Model Based on Graph Neural Networks for Medical Images
CAAI Transactions on Intelligence Technology, Volume 10, Issue 4, Page 1201-1216, August 2025.ABSTRACT Recently, numerous estimation issues have been solved due to the developments in data‐driven artificial neural networks (ANN) and graph neural networks (GNN). The primary limitation of previous methodologies has been the dependence on data that can be structured in a grid format.
Ashutosh Sharma, Amit Sharma, Kai Guo
wiley +1 more source
Security in Metaverse Markets: Challenges and Solutions—A Comprehensive Review
Expert Systems, Volume 42, Issue 8, August 2025.ABSTRACT This review paper provides a systematic overview of the metaverse markets security problems and solutions. The metaverse is an emerging digital space, bridging virtual, augmented and mixed reality environments. As the metaverse evolves, issues related to customer security have emerged, which include breaches of privacy, thefts of identity and ...
Mohammad Z. Aloudat +3 more
wiley +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
A Jump of the Saturation Number in Random Graphs?
Random Structures &Algorithms, Volume 66, Issue 4, July 2025.ABSTRACT For graphs G$$ G $$ and F$$ F $$, the saturation number sat(G,F)$$ sat\left(G,F\right) $$ is the minimum number of edges in an inclusion‐maximal F$$ F $$‐free subgraph of G$$ G $$. In 2017, Korándi and Sudakov initiated the study of saturation in random graphs. They showed that for constant p∈(0,1)$$ p\in \left(0,1\right) $$, whp satG(n,p),Ks=(
Sahar Diskin +2 more
wiley +1 more source
Canonical Labeling of Latin Squares in Average‐Case Polynomial Time
Random Structures &Algorithms, Volume 66, Issue 4, July 2025.ABSTRACT A Latin square of order n$$ n $$ is an n×n$$ n\times n $$ matrix in which each row and column contains each of n$$ n $$ symbols exactly once. For ε>0$$ \varepsilon >0 $$, we show that with high probability a uniformly random Latin square of order n$$ n $$ has no proper subsquare of order larger than n1/2log1/2+εn$$ {n}^{1/2}{\log}^{1/2 ...
Michael J. Gill +2 more
wiley +1 more source
SICode: Embedding-Based Subgraph Isomorphism Identification for Bug Detection
IEEE International Conference on Program ComprehensionGiven a known buggy code snippet, searching for similar patterns in a target project to detect unknown bugs is a reasonable approach. In practice, a search unit, such as a function, may appear quite different from the buggy snippet but actually contains ...
Yuanjun Gong +6 more
semanticscholar +1 more source
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
Subgraph Isomorphism in Planar Graphs and Related Problems
, 1999 David Eppstein
openalex +3 more sources
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