An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs (Q719277): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2011.06.009 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2008676475 / rank | |||
Normal rank | |||
Revision as of 19:28, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs |
scientific article |
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
