Asset Details
Do you wish to reserve the book?
ALGORITMO DE COBERTURA DE VÉRTICES
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
ALGORITMO DE COBERTURA DE VÉRTICES
Do you wish to request the book?
ALGORITMO DE COBERTURA DE VÉRTICES
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
ALGORITMO DE COBERTURA DE VÉRTICES
2023
Overview
Problema a resolver P=NP, utilizando el problema de cobertura de un grafo que es NP y convertirlo a P.En la disciplina matemática de la teoría de grafos, una cobertura de vértices simplemente cobertura de un grafo, es un conjunto de vértices tales que cada arista del grafo es incidente a al menos un vértice del conjunto.El problema de encontrar la menor cobertura de vértices en un grafo se denomina problema de la cobertura de vértices. En teoría de la complejidad computacional se ha demostrado que este es un problema NP-completo.Un problema NP-completo es que no se sabe si tiene solución Polinomial.He encontrado un algoritmo que demuestra que es Polinomial.
Publisher
Corporación Universitaria Republicana
Subject
