An optimal algorithm for the \(k\)-fixed-endpoint path cover on proper interval graphs (Q626964)
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: An optimal algorithm for the \(k\)-fixed-endpoint path cover on proper interval graphs |
scientific article; zbMATH DE number 5853517
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal algorithm for the \(k\)-fixed-endpoint path cover on proper interval graphs |
scientific article; zbMATH DE number 5853517 |
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
