Brightwell, Graham and Winkler, Peter (2004) Note on counting Eulerian circuits. CDAM research report series (LSE-CDAM-2004-12). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.
Full text not available from this repository.Abstract
We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P.
| Item Type: | Monograph (Report) |
|---|---|
| Official URL: | http://www.cdam.lse.ac.uk |
| Additional Information: | © 2004 the authors |
| Divisions: | Mathematics |
| Subjects: | Q Science > QA Mathematics |
| Date Deposited: | 19 Nov 2008 12:51 |
| Last Modified: | 12 Dec 2024 05:40 |
| URI: | http://eprints.lse.ac.uk/id/eprint/13350 |
Actions (login required)
 |
View Item |
