Year: 2004
Type: book
Abstract: We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P.
Authors: Brightwell, Graham R., Winkler, Peter
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1665320540