Note on counting Eulerian circuits

Brightwell, Graham; and Winkler, Peter (2004) Note on counting Eulerian circuits. Technical Report. Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.
Copy

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

Full text not available from this repository.

Atom BibTeX OpenURL ContextObject in Span OpenURL ContextObject Dublin Core MPEG-21 DIDL Data Cite XML EndNote HTML Citation METS MODS RIOXX2 XML Reference Manager Refer ASCII Citation
Export

Downloads