Approximately Counting Hamilton Paths and Cycles in Dense Graphs
From MaRDI portal
Publication:4210094
DOI10.1137/S009753979426112XzbMath0907.68111WikidataQ57401548 ScholiaQ57401548MaRDI QIDQ4210094
Martin Dyer, Alan M. Frieze, Mark R. Jerrum
Publication date: 20 September 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s009753979426112x
68Q25: Analysis of algorithms and problem complexity
Related Items
Approximately Counting Embeddings into Random Graphs, Complexity and approximability of the cover polynomial, Consecutive ones property and PQ-trees for multisets: hardness of counting their orderings, A faster FPTAS for counting two-rowed contingency tables, Switch-based Markov chains for sampling Hamiltonian cycles in dense graphs, Set graphs. II. Complexity of set graph recognition and similar problems, How many needles are in a haystack, or how to solve \#P-complete counting problems fast, On the number of circuits in random graphs