{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T01:59:04Z","timestamp":1787363944098,"version":"build-2736575974"},"reference-count":21,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1998,1]]},"abstract":"<jats:p>We describe fully polynomial randomized approximation schemes for the problems of determining the number of Hamilton paths and cycles in an n-vertex graph with minimum degree $(\\frac{1}{2}+\\a)n$, for any fixed a &gt; 0. We show that the exact counting problems are #P-complete. We also describe fully polynomial randomized approximation schemes for counting paths and cycles of all sizes in such graphs.<\/jats:p>","DOI":"10.1137\/s009753979426112x","type":"journal-article","created":{"date-parts":[[2003,6,11]],"date-time":"2003-06-11T11:12:06Z","timestamp":1055329926000},"page":"1262-1272","source":"Crossref","is-referenced-by-count":29,"title":["Approximately Counting Hamilton Paths and Cycles in Dense Graphs"],"prefix":"10.1137","volume":"27","author":[{"given":"Martin","family":"Dyer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alan","family":"Frieze","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mark","family":"Jerrum","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,28]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548300001188"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"Mikl\u00f3s Simonovits, Paul Erdo\u02dds\u2019 influence on extremal graph theory, Algorithms Combin., Vol. 14, Springer, Berlin, 1997, 148\u201319297h:05092","DOI":"10.1007\/978-3-642-60406-5_15"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1007\/BF00383444"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"A. Z. Broder,\n                      How hard is it to marry at random? (On the approximation of the permanent)\n                      , in Proc. 18th ACM Symposium on Theory of Computing, 1986, pp. 50\u201358. Erratum in Proceedings of the 20th ACM Symposium on Theory of Computing, 1988, p. 551.","DOI":"10.1145\/12130.12136"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s3-2.1.69"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1137\/0217060"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1145\/102782.102783"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0042"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240030304"},{"key":"R10","volume-title":"Concrete mathematics","author":"Graham Ronald","year":"1989"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)00085-9"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1137\/0218077"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1137\/0222066"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(90)90164-D"},{"key":"R15","doi-asserted-by":"crossref","unstructured":"R. M. Karp and M. Luby,\n                      Monte\u2010Carlo algorithms for enumeration and reliability problems\n                      , in Proc. 24th IEEE Symposium on Foundations of Computer Science, 1983, pp. 56\u201364.","DOI":"10.1109\/SFCS.1983.35"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1007\/BF00385809"},{"key":"R17","unstructured":"M. Mihail and P. Winkler,\n                      On the number of Euler orientations of a graph\n                      , in Proc. 3rd Annual ACM\u2010SIAM Symposium on Discrete Algorithms, 1992, pp. 138\u2013145."},{"key":"R18","doi-asserted-by":"crossref","unstructured":"J. Simon,\n                      On the difference between one and many\n                      , in Proc. 4th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science 52, Springer\u2010Verlag, Berlin, 1977, pp. 480\u2013491.","DOI":"10.1007\/3-540-08342-1_37"},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1954-033-3"},{"key":"R20","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(79)90044-6"},{"key":"R21","doi-asserted-by":"publisher","DOI":"10.1137\/0208032"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/S009753979426112X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:14:08Z","timestamp":1787336048000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/S009753979426112X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":21,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["10.1137\/S009753979426112X"],"URL":"https:\/\/doi.org\/10.1137\/s009753979426112x","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}