An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs (Q719277)
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: An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs |
scientific article; zbMATH DE number 5955893
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs |
scientific article; zbMATH DE number 5955893 |
Statements
An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs (English)
0 references
10 October 2011
0 references
certifying algorithm
0 references
Hamiltonian cycle
0 references
path cover
0 references
interval graphs
0 references
circular-arc graphs
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
