The longest path problem is polynomial on cocomparability graphs (Q1939666)
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 path problem is polynomial on cocomparability graphs |
scientific article; zbMATH DE number 6141206
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The longest path problem is polynomial on cocomparability graphs |
scientific article; zbMATH DE number 6141206 |
Statements
The longest path problem is polynomial on cocomparability graphs (English)
0 references
5 March 2013
0 references
longest path problem
0 references
cocomparability graphs
0 references
permutation graphs
0 references
polynomial algorithm
0 references
complexity
0 references
