A Polynomial-Time Algorithm to Determine (Almost) Hamiltonicity of Dense Regular Graphs (Q5084096): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3045552448 / rank | |||
Normal rank | |||
Latest revision as of 08:41, 30 July 2024
scientific article; zbMATH DE number 7546786
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
