Narrowing the Complexity Gap for Colouring ($C_s$, $P_t$)-Free Graphs.

Shenwei Huang Matthew Johnson Daniël Paulusma

Published in: CoRR (2014)

Keyphrases

graph theory
computational complexity
computational cost
worst case
graph structure
graph clustering
neural network
pairwise
non stationary
decision problems
space complexity
graph theoretic
polynomial time complexity