Computing and counting longest paths on circular-arc graphs in polynomial time (Q2448873)
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 6292042
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing and counting longest paths on circular-arc graphs in polynomial time |
scientific article; zbMATH DE number 6292042 |
Statements
Computing and counting longest paths on circular-arc graphs in polynomial time (English)
0 references
5 May 2014
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 references
0 references
0.9935216903686525
0 references
0.8513035178184509
0 references
0.8314735889434814
0 references
0.8027446866035461
0 references
0.7976595759391785
0 references
