More results on the complexity of identifying problems in graphs.

Olivier Hudry Antoine Lobstein

Published in: Theor. Comput. Sci. (2016)

Keyphrases

np complete
decision problems
polynomial time complexity
problems involving
real time
pattern recognition
optimization problems
application domains
solving problems
search algorithm
computational complexity
semi supervised
graph theoretic