The longest path problem is polynomial on cocomparability graphs (Q1939666): Difference between revisions
From MaRDI portal
Created claim: MaRDI profile type (P1460): Publication (Q5976449), #quickstatements; #temporary_batch_1710362834424 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00453-011-9583-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2106934213 / rank | |||
Normal rank | |||
Revision as of 01:30, 20 March 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
