Please use this identifier to cite or link to this item:
http://ri.uaemex.mx/handle20.500.11799/67665| Title: | Low-Exponential Algorithm for Counting the Number of Edge Cover on Simple Graphs | Authors: | GUILLERMO DE ITA LUNA JOSE RAYMUNDO MARCIAL ROMERO JOSE ANTONIO HERNANDEZ SERVIN |
Keywords: | edge covering;graph theory;integer partition;info:eu-repo/classification/cti/7 | Publisher: | Computación y Sistemas | Project: | 21;3 | 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. | URI: | http://ri.uaemex.mx/handle/20.500.11799/67665 | Other Identifiers: | 2007-9737 http://hdl.handle.net/20.500.11799/67665 |
Rights: | info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc-sa/4.0 |
| Appears in Collections: | Producción |
Show full item record
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.