Improved hardness for H-colourings of G-colourable graphs.

Marcin Wrochna Stanislav Zivný

Published in: CoRR (2019)

Keyphrases

graph matching
computational complexity
np hard
directed graph
graph theoretic
machine learning
social networks
graph theory
graph structure
complex structures
graph partitioning
graph clustering