Mostrar el registro sencillo del objeto digital
dc.creator | José A. Hernández-Servín | |
dc.creator | J. Raymundo Marcial-Romero | |
dc.creator | Guillermo De Ita Luna | |
dc.date | 2017 | |
dc.date.accessioned | 2018-03-07T17:09:57Z | |
dc.date.available | 2018-03-07T17:09:57Z | |
dc.identifier | http://www.redalyc.org/articulo.oa?id=61552758006 | |
dc.identifier.uri | http://hdl.handle.net/20.500.11799/78279 | |
dc.description | 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. | |
dc.format | application/pdf | |
dc.language | en | |
dc.publisher | Instituto Politécnico Nacional | |
dc.relation | http://www.redalyc.org/revista.oa?id=615 | |
dc.rights | Computación y Sistemas | |
dc.source | Computación y Sistemas (México) Num.3 Vol.21 | |
dc.subject | Computación | |
dc.subject | Edge covering | |
dc.subject | graph theory | |
dc.subject | integer partition | |
dc.title | Low-Exponential Algorithm for Counting the Number of Edge Cover on Simple Graphs | |
dc.type | Artículo |
Ficheros | Tamaño | Formato | Ver documento |
---|---|---|---|
No hay resultados asociados a este ítem. |