Approximately Counting Hamilton Paths and Cycles in Dense Graphs

Martin E. Dyer, Alan M. Frieze, Mark Jerrum. Approximately Counting Hamilton Paths and Cycles in Dense Graphs. SIAM Journal on Computing, 27(5):1262-1272, 1998. [doi]

@article{DyerFJ98,
  title = {Approximately Counting Hamilton Paths and Cycles in Dense Graphs},
  author = {Martin E. Dyer and Alan M. Frieze and Mark Jerrum},
  year = {1998},
  url = {http://epubs.siam.org/sam-bin/dbq/article/26112},
  tags = {graph-rewriting, e-science, rewriting},
  researchr = {https://researchr.org/publication/DyerFJ98},
  cites = {0},
  citedby = {0},
  journal = {SIAM Journal on Computing},
  volume = {27},
  number = {5},
  pages = {1262-1272},
}