Generating and Counting Hamilton Cycles in Random Regular Graphs (Q4895803)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 936169
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generating and Counting Hamilton Cycles in Random Regular Graphs |
scientific article; zbMATH DE number 936169 |
Statements
Generating and Counting Hamilton Cycles in Random Regular Graphs (English)
0 references
16 December 1996
0 references
polynomial time algorithms
0 references
Hamilton cycles
0 references
0.9612409
0 references
0.95375687
0 references
0.9520605
0 references
0.9491601
0 references
0.9434399
0 references
0.9363805
0 references
0.93395686
0 references
