An optimal algorithm for the \(k\)-fixed-endpoint path cover on proper interval graphs (Q626964): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s11786-009-0004-y / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S11786-009-0004-Y / rank | |||
Normal rank | |||
Latest revision as of 22:41, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal algorithm for the \(k\)-fixed-endpoint path cover on proper interval graphs |
scientific article |
Statements
An optimal algorithm for the \(k\)-fixed-endpoint path cover on proper interval graphs (English)
0 references
19 February 2011
0 references
proper interval graph
0 references
perfect graph
0 references
path cover
0 references
SNIR matrix
0 references
linear-time algorithm
0 references
0 references
0 references
