Note on Counting Eulerian Circuits

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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

Keywords

Computational Complexity, Discrete Mathematics, F.2.2; G.2.2

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/32144

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0405067
 http://arxiv.org/abs/cs/0405067

Collections

arXiv