In particular, those whose NP-completeness or NP-hardness is not been proven. Problems, having the hope to be solved in polynomial time, that can contribute to the development of the graph theory.

Similar questions and discussions