a-perfect graphs in polynomial time.

Arnaud Pêcher Annegret Wagler

Published in: Eur. J. Comb. (2014)

Keyphrases

np complete
polynomial time complexity
bounded treewidth
computational complexity
conjunctive queries
graph isomorphism
neural network
data sets
pattern recognition
special case
upper bound
graph matching
graph structure
complex structures
graph theoretic
bounded degree