A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
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.doi:10.13053/cys-21-3-2244 fatcat:zsqusjnmkncxhmemord5exxfl4