PUERTA | PUERTA CS 2013 | Pregunta 18
¿Cuáles de las siguientes afirmaciones son VERDADERAS? 1. The problem of determining whether there exists a cycle in an undirected graph is in P. 2. The problem of determining whether there exists a cycle in an undirected graph is in NP. 3. If a problem A is NP-Complete, there exists a non-deterministic polynomial time algorithm … Continue reading «PUERTA | PUERTA CS 2013 | Pregunta 18»