On a simple randomized algorithm for finding a 2-factor in sparse graphs (Q1041775)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On a simple randomized algorithm for finding a 2-factor in sparse graphs |
scientific article; zbMATH DE number 5642359
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a simple randomized algorithm for finding a 2-factor in sparse graphs |
scientific article; zbMATH DE number 5642359 |
Statements
On a simple randomized algorithm for finding a 2-factor in sparse graphs (English)
0 references
4 December 2009
0 references
graph algorithms
0 references
randomized algorithms
0 references
random walks
0 references
sparse graphs
0 references
2-factor
0 references
Hamiltonian cycle
0 references
long cycle
0 references
0.9533636
0 references
0.88321066
0 references
0.88168776
0 references
0.88168776
0 references
0.87900233
0 references
0 references
0.86773384
0 references
