Resumo

HERNANDEZ-SERVIN, José A.; MARCIAL-ROMERO, J. Raymundo  e  ITA LUNA, Guillermo De. Low-Exponential Algorithm for Counting the Number of Edge Cover on Simple Graphs. Comp. y Sist. [online]. 2017, vol.21, n.3, pp.449-456. ISSN 2007-9737.  https://doi.org/10.13053/cys-21-3-2244.

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.

Palavras-chave : Edge covering; graph theory; integer partition.