{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:08:18Z","timestamp":1725552498222},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642121999"},{"type":"electronic","value":"9783642122002"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12200-2_55","type":"book-chapter","created":{"date-parts":[[2010,4,21]],"date-time":"2010-04-21T13:53:05Z","timestamp":1271857985000},"page":"638-649","source":"Crossref","is-referenced-by-count":2,"title":["The Complexity of Counting Eulerian Tours in 4-Regular Graphs"],"prefix":"10.1007","author":[{"given":"Qi","family":"Ge","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"\u0160tefankovi\u010d","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"55_CR1","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0166-218X(93)E0172-U","volume":"59","author":"L.D. Andersen","year":"1995","unstructured":"Andersen, L.D., Fleischner, H.: The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphs. Discrete Appl. Math.\u00a059(3), 203\u2013214 (1995)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"55_CR2","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0166-218X(87)90045-X","volume":"18","author":"S.W. Bent","year":"1987","unstructured":"Bent, S.W., Manber, U.: On nonintersecting Eulerian circuits. Discrete Appl. Math.\u00a018(1), 87\u201394 (1987)","journal-title":"Discrete Appl. Math."},{"key":"55_CR3","series-title":"Foundations of Computing Series","volume-title":"Algorithmic number theory","author":"E. Bach","year":"1996","unstructured":"Bach, E., Shallit, J.: Algorithmic number theory. Foundations of Computing Series, vol.\u00a01. MIT Press, Cambridge (1996); Efficient algorithms"},{"key":"55_CR4","unstructured":"Brightwell, G., Winkler, P.: Counting eulerian circuits is #p-complete. In: ALENEX\/ANALCO, pp. 259\u2013262 (2005)"},{"issue":"3","key":"55_CR5","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s00453-003-1073-y","volume":"38","author":"M. Dyer","year":"2004","unstructured":"Dyer, M., Goldberg, L.A., Greenhill, C., Jerrum, M.: The relative complexity of approximate counting problems. Algorithmica\u00a038(3), 471\u2013500 (2004); Approximation algorithms","journal-title":"Algorithmica"},{"key":"55_CR6","unstructured":"Dvo\u0159\u00e1k, Z.: Eulerian tours in graphs with forbidden transitions and bounded degree. KAM-DIMATIA\u00a0(669) (2004)"},{"key":"55_CR7","series-title":"Annals of Discrete Mathematics","volume-title":"Eulerian graphs and related topics. Part 1. vol. 1","author":"H. Fleischner","year":"1990","unstructured":"Fleischner, H.: Eulerian graphs and related topics. Part 1. vol. 1. Annals of Discrete Mathematics, vol.\u00a045. North-Holland Publishing Co., Amsterdam (1990)"},{"key":"55_CR8","unstructured":"Jerrum, M.: \n                  \n                    http:\/\/www.ams.org\/mathscinet\/search\/publdoc.html?pg1=ISSI&s1=191567&r=2&mx-pid=1822924"},{"key":"55_CR9","doi-asserted-by":"crossref","unstructured":"Jerrum, M.: Counting, sampling and integrating: algorithms and complexity. Lectures in Mathematics. ETH Z\u00fcrich. Birkh\u00e4user Verlag, Basel (2003)","DOI":"10.1007\/978-3-0348-8005-3"},{"key":"55_CR10","first-page":"219","volume-title":"Theory of Graphs (Proc. Colloq., Tihany, 1966)","author":"A. Kotzig","year":"1968","unstructured":"Kotzig, A.: Eulerian lines in finite 4-valent graphs and their transformations. In: Theory of Graphs (Proc. Colloq., Tihany, 1966), pp. 219\u2013230. Academic Press, New York (1968)"},{"issue":"3","key":"55_CR11","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1007\/s00453-001-0018-6","volume":"30","author":"P. Tetali","year":"2001","unstructured":"Tetali, P., Vempala, S.: Random sampling of Euler tours. Algorithmica\u00a030(3), 376\u2013385 (2001); Approximation algorithms for combinatorial optimization problems","journal-title":"Algorithmica"},{"key":"55_CR12","volume-title":"Approximation algorithms","author":"V.V. Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation algorithms. Springer, Berlin (2001)"},{"issue":"1","key":"55_CR13","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1214\/aoap\/1075828054","volume":"14","author":"D.B. Wilson","year":"2004","unstructured":"Wilson, D.B.: Mixing times of Lozenge tiling and card shuffling Markov chains. Ann. Appl. Probab.\u00a014(1), 274\u2013325 (2004)","journal-title":"Ann. Appl. Probab."}],"container-title":["Lecture Notes in Computer Science","LATIN 2010: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12200-2_55.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:05:40Z","timestamp":1619784340000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12200-2_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642121999","9783642122002"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12200-2_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}