Mostrar el registro sencillo del objeto digital
dc.contributor.author | DE ITA LUNA, GUILLERMO | |
dc.contributor.author | MARCIAL ROMERO, JOSE RAYMUNDO | |
dc.contributor.author | HERNANDEZ SERVIN, JOSE ANTONIO | |
dc.creator | DE ITA LUNA, GUILLERMO; 57559 | |
dc.creator | MARCIAL ROMERO, JOSE RAYMUNDO; 39478 | |
dc.creator | HERNANDEZ SERVIN, JOSE ANTONIO; 89146 | |
dc.date.accessioned | 2017-11-13T23:12:54Z | |
dc.date.available | 2017-11-13T23:12:54Z | |
dc.date.issued | 2017-01-01 | |
dc.identifier.issn | 2007-9737 | |
dc.identifier.uri | http://hdl.handle.net/20.500.11799/67665 | |
dc.description.abstract | A procedure for counting edge covers of simple graphs is presented. The procedure splits simple graphs into non-intersecting cycle graphs. This is a “low exponential” exact algorithm to count edge covers for simple graphs whose upper bound in the worst case is O(1.465575(m−n) × (m + n)), where m and n are the number of edges and nodes of the input graph, respectively. | es |
dc.language.iso | eng | es |
dc.publisher | Computación y Sistemas | es |
dc.relation.ispartofseries | 21;3 | |
dc.rights | openAccess | es |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0 | |
dc.subject | edge covering | es |
dc.subject | graph theory | es |
dc.subject | integer partition | es |
dc.subject.classification | INGENIERÍA Y TECNOLOGÍA | |
dc.title | Low-Exponential Algorithm for Counting the Number of Edge Cover on Simple Graphs | es |
dc.type | Artículo | es |
dc.provenance | Científica | es |
dc.road | Dorada | es |
dc.ambito | Internacional | es |
dc.audience | students | |
dc.audience | researchers | |
dc.type.conacyt | article | |
dc.identificator | 7 |