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.
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)|
|Additional Information:||© 2004 the authors|
|Library of Congress subject classification:||Q Science > QA Mathematics|
|Sets:||Departments > Mathematics|
|Date Deposited:||19 Nov 2008 12:51|
Actions (login required)
|Record administration - authorised staff only|