A polynomial time algorithm for longest paths in biconvex graphs (Q3078397)
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 polynomial time algorithm for longest paths in biconvex graphs |
scientific article; zbMATH DE number 5853614
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial time algorithm for longest paths in biconvex graphs |
scientific article; zbMATH DE number 5853614 |
Statements
A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs (English)
0 references
20 February 2011
0 references
longest path problem
0 references
biconvex graphs
0 references
polynomial algorithm
0 references
complexity
0 references
dynamic programming
0 references
0.8371813893318176
0 references
0.8311876654624939
0 references
0.822457492351532
0 references
0.8050454258918762
0 references
0.8016198873519897
0 references
