Resource title

Note on counting Eulerian circuits

Resource image

image for OpenScout resource :: Note on counting Eulerian circuits

Resource description

We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P.

Resource author

Resource publisher

Resource publish date

Resource language

en

Resource content type

Resource resource URL

http://eprints.lse.ac.uk/13350/

Resource license