Note on counting Eulerian circuits
Abstract
We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #PSimilar works
This paper was published in LSE Research Online.
Having an issue?
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.