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 |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9105398058891296
0 references
0.9097121953964232
0 references
0.8192529082298279
0 references
0.8109213709831238
0 references
0.7995169162750244
0 references
