on the Complexity of Recognizing a Class of Perfectly orderable Graphs.

Chính T. Hoàng

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

Keyphrases

genetic algorithm
tractable cases
training data
pattern recognition
computational complexity
random walk
directed graph
object classes
graph theory
weighted graph
space complexity
multi class classification
graph theoretic
polynomial time complexity