Narrowing the Complexity Gap for Colouring (C s , P t )-Free Graphs.

Shenwei Huang Matthew Johnson Daniël Paulusma

Published in: AAIM (2014)

Keyphrases

computational complexity
worst case
polynomial time complexity
neural network
directed graph
graph matching
graph theory
bounded treewidth
pattern recognition
computational cost
supply chain
np complete
decision problems
graph databases
subgraph isomorphism
structured objects