Results 91 to 100 of about 39,682 (219)

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

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

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  

Subgraph Isomorphism in Planar Graphs and Related Problems

, 1999
David Eppstein
openalex   +3 more sources

A Note on the Spanning Subgraph Isomorphism Problem

A Note on the Spanning Subgraph Isomorphism Problem
identifier:oai:t2r2.star.titech.ac.jp ...
openaire   +1 more source

A Method Based on Timing Weight Priority and Distance Optimization for Quantum Circuit Transformation. [PDF]

Entropy (Basel), 2023
Qian Y, Guan Z, Zheng S, Feng S.
europepmc   +1 more source

ArieL: Adversarial Graph Contrastive Learning. [PDF]

ACM Trans Knowl Discov Data, 2023
Feng S, Jing B, Zhu Y, Tong H.
europepmc   +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

A novel approach to graph distinction through GENEOs and permutants. [PDF]

Sci Rep
Bocchi G, Ferri M, Frosini P.
europepmc   +1 more source

Searching chemical databases in the pre-history of cheminformatics. [PDF]

J Cheminform
Willett P.
europepmc   +1 more source