Computing and counting longest paths on circular-arc graphs in polynomial time (Q2840712)
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: Computing and counting longest paths on circular-arc graphs in polynomial time |
scientific article; zbMATH DE number 6190246
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing and counting longest paths on circular-arc graphs in polynomial time |
scientific article; zbMATH DE number 6190246 |
Statements
23 July 2013
0 references
circular-arc graphs
0 references
interval graphs
0 references
longest path problem
0 references
counting
0 references
approximation algorithm
0 references
dynamic programming
0 references
0.9999999
0 references
0.9314296
0 references
0 references
0.8962616
0 references
0.89365095
0 references
0.88741827
0 references
0 references
0.88525695
0 references
Computing and counting longest paths on circular-arc graphs in polynomial time (English)
0 references
