A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs (Q4899036)
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: A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs |
scientific article; zbMATH DE number 6122000
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs |
scientific article; zbMATH DE number 6122000 |
Statements
A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs (English)
0 references
4 January 2013
0 references
cocomparability graphs
0 references
longest path problem
0 references
lexicographic depth first search
0 references
dynamic programming
0 references
polynomial algorithm
0 references
