On the complexity of 4-coloring graphs without long induced paths.

Van Bang Le Bert Randerath Ingo Schiermeyer

Published in: Theor. Comput. Sci. (2007)

Keyphrases

graph theoretic
directed graph
shortest path
feature selection
pattern recognition
graph matching
computational cost
polynomial time complexity
space complexity
graph model
complex networks
data sets
evolutionary algorithm
computational complexity
information systems
social networks
databases