Counting Eulerian Circuits is - Route inspection problem - Document - PDFSEARCH.IO

First Page	Meta Content
	Counting Eulerian Circuits is #P-Complete Graham R. Brightwell Abstract We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P. The method employed is mod Add to Reading List Document Date: 2005-07-06 08:19:12 Open Document File Size: 98,27 KB Share Result on Facebook City Addison-Wesley / London / / Country United States / United Kingdom / / Currency pence / / / Organization Institute for Advanced Study / London School of Economics / Department of Mathematics / Oxford University / / Person Peter Winkler / Mihail / / ProvinceOrState New York / / PublishedMedium the Theory of Computing / / SocialTag Eulerian path NP-complete problems BEST theorem Degree Connectivity Hamiltonian path Tree Graph Route inspection problem Graph theory

Counting Eulerian Circuits is #P-Complete Graham R. Brightwell Abstract We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P. The method employed is modAdd to Reading List