A simple algorithm to find Hamiltonian cycles in proper interval graphs (Q989586)
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 simple algorithm to find Hamiltonian cycles in proper interval graphs |
scientific article; zbMATH DE number 5773861
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple algorithm to find Hamiltonian cycles in proper interval graphs |
scientific article; zbMATH DE number 5773861 |
Statements
A simple algorithm to find Hamiltonian cycles in proper interval graphs (English)
0 references
20 August 2010
0 references
graph algorithms
0 references
Hamiltonian cycle
0 references
proper interval graph
0 references
interval graph
0 references
Chordal graph
0 references
0 references
0 references
0 references
0.8419912457466125
0 references
0.827681303024292
0 references
0.8250588774681091
0 references
0.8217638731002808
0 references
0.7950596809387207
0 references
