Login / Signup
Updating the complexity status of coloring graphs without a fixed induced linear forest.
Hajo Broersma
Petr A. Golovach
Daniël Paulusma
Jian Song
Published in:
Theor. Comput. Sci. (2012)
Keyphrases
</>
computational complexity
series parallel
graph theoretic
linear complexity
neural network
worst case
random walk
decision problems
graph matching
graph theory
real time
case study
reinforcement learning
association rules
fixed number
polynomial time complexity