On the Complexity of Approximating Colored-Graph Problems.

Andrea E. F. Clementi Pierluigi Crescenzi Gianluca Rossi

Published in: COCOON (1999)

Keyphrases

decision problems
optimization problems
graph theory
problems involving
random walk
computational issues
polynomial hierarchy
polynomial time complexity
case study
high dimensional
np complete
structured data
application domains
graph mining
graph representation
graph based algorithm