An optimal algorithm for the \(k\)-fixed-endpoint path cover on proper interval graphs (Q626964): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s11786-009-0004-y / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2147102683 / rank | |||
Normal rank | |||
Revision as of 22:15, 19 March 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
