Computing and counting longest paths on circular-arc graphs in polynomial time (Q2448873)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing and counting longest paths on circular-arc graphs in polynomial time |
scientific article |
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
