Complexity of planar signed graph homomorphisms to cycles.

François Dross Florent Foucaud Valia Mitsou Pascal Ochem Théo Pierron

Published in: CoRR (2019)

Keyphrases

graph theory
planar graphs
graph representation
lower bound
random walk
worst case
structured data
connected components
graph structure
neural network
space complexity
causal graph
graph mining
stable set
dependency graph
random graphs
graph theoretic
undirected graph
computational complexity
social networks