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

The subgraph isomorphism problem

open access: yes, 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

open access: yes, 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  

A Note on the Spanning Subgraph Isomorphism Problem

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

ArieL: Adversarial Graph Contrastive Learning. [PDF]

open access: yesACM 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

open access: yes, 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

Home - About - Disclaimer - Privacy