Location of Repository

Note on counting Eulerian circuits

By Graham Brightwell and Peter Winkler

Abstract

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

Topics: QA Mathematics
Publisher: Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science
Year: 2004
OAI identifier: oai:eprints.lse.ac.uk:13350
Provided by: LSE Research Online
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://www.cdam.lse.ac.uk (external link)
  • http://eprints.lse.ac.uk/13350... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.