DE ITA LUNA, GUILLERMO; MARCIAL ROMERO, JOSE RAYMUNDO; HERNANDEZ SERVIN, JOSE ANTONIO
(Computación y Sistemas, 2017-01-01)
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 ...