An improved fully polynomial randomized approximation scheme (FPRAS) for counting the number of Hamiltonian cycles in dense digraphs (Q620956): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2010.10.014 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2010.10.014 / rank | |||
Normal rank | |||
Latest revision as of 22:54, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved fully polynomial randomized approximation scheme (FPRAS) for counting the number of Hamiltonian cycles in dense digraphs |
scientific article |
Statements
An improved fully polynomial randomized approximation scheme (FPRAS) for counting the number of Hamiltonian cycles in dense digraphs (English)
0 references
2 February 2011
0 references
Hamiltonian cycle
0 references
1-factor
0 references
counting
0 references
\#P-complete
0 references
0 references
0 references
