Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs (Q628259)
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: Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs |
scientific article; zbMATH DE number 5864272
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs |
scientific article; zbMATH DE number 5864272 |
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
0 references
0 references
0 references
0 references
0.8705671429634094
0 references
0.8696107268333435
0 references
0.8289908170700073
0 references
0.7811822295188904
0 references
