Counting Eulerian Circuits is #P-Complete

@inproceedings{Brightwell2005CountingEC,
  title={Counting Eulerian Circuits is #P-Complete},
  author={Graham R. Brightwell and Peter Winkler},
  booktitle={ALENEX/ANALCO},
  year={2005}
}
We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P. The method employed is mod-p reduction from counting Eulerian orientations. 
Highly Cited
This paper has 47 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Counting

M. Jerrum
Sampling and Integrating: Algorithms and Complexity, Lectures in Mathematics, ETH Zrich, Birkhuser Verlag, Basel • 2003

Graph Theory

W. T. Tutte
Addison-Wesley, New York • 1984
View 1 Excerpt

The Complexity of Computing the Permanent

Theor. Comput. Sci. • 1979
View 3 Excerpts