The longest path problem is polynomial on cocomparability graphs (Q1939666): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:45, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The longest path problem is polynomial on cocomparability graphs |
scientific article |
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
