Computing and counting longest paths on circular-arc graphs in polynomial time (Q2448873): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/dam/MertziosB14, #quickstatements; #temporary_batch_1731468600454 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/dam/MertziosB14 / rank | |||
Normal rank | |||
Latest revision as of 05:03, 13 November 2024
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
