Computing and Counting Longest Paths on Circular-Arc Graphs in Polynomial Time (Q2840712)
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
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
