| Journal: | Computación y sistemas |
| Database: | PERIÓDICA |
| System number: | 000423346 |
| ISSN: | 1405-5546 |
| Authors: | Hernández Servín, José A1 Marcial Romero, J. Raymundo1 Ita Luna, Guillermo De2 |
| Institutions: | 1Universidad Autónoma del Estado de México, Toluca, Estado de México. México 2Benemérita Universidad Autónoma de Puebla, Puebla. México |
| Year: | 2017 |
| Season: | Jul-Sep |
| Volumen: | 21 |
| Number: | 3 |
| Country: | México |
| Language: | Inglés |
| Document type: | Artículo |
| Approach: | Aplicado, descriptivo |
| English 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 |
| Disciplines: | Ciencias de la computación |
| Keyword: | Procesamiento de datos, Procesamiento de imágenes, Cubrimiento de bordes, Teoría de grafos, Partición |
| Keyword: | Data processing, Image processing, Edge covering, Graph theory, Partition |
| Full text: | Texto completo (Ver HTML) Texto completo (Ver PDF) |
