Low-Exponential Algorithm for Counting the Number of Edge Cover on Simple Graphs Academic Article uri icon

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 ca