The longest path problem is polynomial on cocomparability graphs (Q1939666): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q56639277, #quickstatements; #temporary_batch_1711504539957 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56639277 / rank | |||
Normal rank | |||
Revision as of 03:22, 27 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
