Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs (Q628259): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:18, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs |
scientific article |
Statements
Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs (English)
0 references
10 March 2011
0 references
certifying algorithms
0 references
path cover
0 references
Hamiltonian cycle
0 references
interval graphs
0 references
