Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy

2006 ◽  
pp. 15-26 ◽  
Author(s):  
Jiří Fiala ◽  
Jan Kratochvíl
Keyword(s):  
Graph Homomorphism

scholarly journals Density and power graphs in graph homomorphism problem

2008 ◽  
Vol 308 (17) ◽  
pp. 4027-4030 ◽  
Author(s):  
Amir Daneshgar ◽  
Hossein Hajiabolhassan
Keyword(s):  
Graph Homomorphism

Graph Modification for Edge-Coloured and Signed Graph Homomorphism Problems: Parameterized and Classical Complexity

Algorithmica ◽  
2022 ◽  
Author(s):  
Florent Foucaud ◽  
Hervé Hocquard ◽  
Dimitri Lajou ◽  
Valia Mitsou ◽  
Théo Pierron
Keyword(s):  
Signed Graph ◽  
Graph Homomorphism ◽  
Graph Modification

scholarly journals Tight Bounds for Graph Homomorphism and Subgraph Isomorphism

2015 ◽  
Author(s):  
Marek Cygan ◽  
Fedor V. Fomin ◽  
Alexander Golovnev ◽  
Alexander S. Kulikov ◽  
Ivan Mihajlin ◽  
...  
Keyword(s):  
Subgraph Isomorphism ◽  
Graph Homomorphism

Efficient pipelined execution of CNNs based on in-memory computing and graph homomorphism verification

2021 ◽  
pp. 1-1
Author(s):  
Martino Dazzi ◽  
Abu Sebastian ◽  
Thomas Parnell ◽  
Pier Andrea Francese ◽  
Luca Benini ◽  
...  
Keyword(s):  
Graph Homomorphism

scholarly journals Dual graph homomorphism functions

2010 ◽  
Vol 117 (2) ◽  
pp. 216-222 ◽  
Author(s):  
László Lovász ◽  
Alexander Schrijver
Keyword(s):  
Dual Graph ◽  
Graph Homomorphism

scholarly journals Solving Graph Homomorphism and Subgraph Isomorphism Problems Faster Through Clique Neighbourhood Constraints

2021 ◽  
Author(s):  
Sonja Kraiczy ◽  
Ciaran McCreesh
Keyword(s):  
Constraint Programming ◽  
State Of The Art ◽  
Programming Approach ◽  
Subgraph Isomorphism ◽  
Graph Homomorphism ◽  
General Graph ◽  
Graph Homomorphisms ◽  
Practical Constraint ◽  
New Form ◽  
Programming Algorithms

Graph homomorphism problems involve finding adjacency-preserving mappings between two given graphs. Although theoretically hard, these problems can often be solved in practice using constraint programming algorithms. We show how techniques from the state-of-the-art in subgraph isomorphism solving can be applied to broader graph homomorphism problems, and introduce a new form of filtering based upon clique-finding. We demonstrate empirically that this filtering is effective for the locally injective graph homomorphism and subgraph isomorphism problems, and gives the first practical constraint programming approach to finding general graph homomorphisms.

scholarly journals Graph operations and upper bounds on graph homomorphism counts

2017 ◽  
Vol 87 (2) ◽  
pp. 149-163 ◽  
Author(s):  
Luke Sernau
Keyword(s):  
Upper Bounds ◽  
Graph Homomorphism ◽  
Graph Operations
Sign in / Sign up

Export Citation Format

Share Document