{"title":"ALGORITMO DE COBERTURA DE VÉRTICES","authors":"JAVIER LÓPEZ WONG","doi":"10.21017/rimci.2023.v10.n20.a146","DOIUrl":null,"url":null,"abstract":"Problem to solve P=NP, using the coverage problem of a graph that is NP and convert it to P. In the mathematical discipline of graph theory, a vertex cover, simply a graph cover, is a set of vertices such that each edge of the graph is incident to at least one vertex of the set. The problem of finding the smallest vertex coverage in a graph is called the vertex coverage problem. In computational complexity theory, it has been shown that this is an NP-complete problem. An NPcomplete problem is that it is not known if it has a Polynomial solution. I have found an algorithm that proves that it is Polynomial.","PeriodicalId":267527,"journal":{"name":"Revista Ingeniería, Matemáticas y Ciencias de la Información","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Revista Ingeniería, Matemáticas y Ciencias de la Información","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.21017/rimci.2023.v10.n20.a146","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Problem to solve P=NP, using the coverage problem of a graph that is NP and convert it to P. In the mathematical discipline of graph theory, a vertex cover, simply a graph cover, is a set of vertices such that each edge of the graph is incident to at least one vertex of the set. The problem of finding the smallest vertex coverage in a graph is called the vertex coverage problem. In computational complexity theory, it has been shown that this is an NP-complete problem. An NPcomplete problem is that it is not known if it has a Polynomial solution. I have found an algorithm that proves that it is Polynomial.