The longest cycle problem is polynomial on interval graphs (Q2227488)
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: The longest cycle problem is polynomial on interval graphs |
scientific article; zbMATH DE number 7310528
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The longest cycle problem is polynomial on interval graphs |
scientific article; zbMATH DE number 7310528 |
Statements
The longest cycle problem is polynomial on interval graphs (English)
0 references
15 February 2021
0 references
longest cycle problem
0 references
interval graphs
0 references
\(k\)-thick graphs
0 references
polynomial algorithm
0 references
dynamic programming
0 references
longest path problem
0 references
0 references
0 references
0.94641215
0 references
0 references
0.89616096
0 references
0.8961607
0 references
0 references
0 references
0.8891865
0 references
0.8891865
0 references
0.88900095
0 references
