A polynomial-time algorithm to determine (almost) Hamiltonicity of dense regular graphs (Q5084096)
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: A polynomial-time algorithm to determine (almost) Hamiltonicity of dense regular graphs |
scientific article; zbMATH DE number 7546786
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial-time algorithm to determine (almost) Hamiltonicity of dense regular graphs |
scientific article; zbMATH DE number 7546786 |
Statements
A Polynomial-Time Algorithm to Determine (Almost) Hamiltonicity of Dense Regular Graphs (English)
0 references
23 June 2022
0 references
graph algorithm
0 references
Hamilton cycle
0 references
robust expander
0 references
graph partitioning
0 references
0 references
0 references
0.8093491196632385
0 references
0.8000695109367371
0 references
0.7844738364219666
0 references
0.7834394574165344
0 references
0.7793271541595459
0 references
