The Complexity of some Problems Related to Graph 3-colorability.

Andreas Brandstädt Van Bang Le Thomas Szymczak

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

Keyphrases

solving problems
problems involving
computational complexity
learning algorithm
worst case
np hardness
data sets
optimization problems
random walk
shortest path
graph theory
graph structure
shortest path problem
polynomial hierarchy