Which of bellow sentences is correct?
1) Both problems of (A) finding a Hamiltonian Cycle and (B) finding a Eulerian Cycle belongs to the NP - Complete class of problems.
2) There aren't graphs that accept both a hamiltonian cycle and a eulerian cycle simultaneously.
3) Eulerian and Hamiltonian graphs are necessarily connected graphs.
4) The Travelling Salesman Problem (TSP) is a particular case of the problem of finding a eulerian cycle.
5) NDA
Author: Roberto Hiroshi Higa
Translated by: Rafael S. Padilha
Nenhum comentário:
Postar um comentário