Note on Counting Eulerian Circuits
arXiv:cs/0405067
Abstract
We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P.
2 figures
arXiv:cs/0405067
We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P.
2 figures