The complexity of the T-coloring problem for graphs with small degree.

Krzysztof Giaro Robert Janczewski Michal Malafiejski

Published in: Discret. Appl. Math. (2003)

Keyphrases

small number
graph databases
directed graph
bounded treewidth
real time
graph structure
graph matching
np hard
decision problems
lower bound
computational complexity
search algorithm
graph mining
decision trees
graph representation
graph theoretic
random graphs
feature selection