Zobrazeno 1 - 1
of 1
pro vyhledávání: '"PINYAN LU"'
Publikováno v:
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms.
An edge cover of a graph is a set of edges such that every vertex has at least an adjacent edge in it. Previously, approximation algorithm for counting edge covers is only known for 3 regular graphs and it is randomized. We design a very simple deter