The 1-fixed-endpoint path cover problem is Polynomial on interval graphs (Q1957649)
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: The 1-fixed-endpoint path cover problem is Polynomial on interval graphs |
scientific article; zbMATH DE number 5791714
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The 1-fixed-endpoint path cover problem is Polynomial on interval graphs |
scientific article; zbMATH DE number 5791714 |
Statements
The 1-fixed-endpoint path cover problem is Polynomial on interval graphs (English)
0 references
27 September 2010
0 references
Perfect graphs
0 references
Interval graphs
0 references
Path cover
0 references
Fixed-endpoint path cover
0 references
Linear-time algorithms
0 references
0 references
0 references
0.9611355
0 references
0.9332025
0 references
0.9139931
0 references
0.89549947
0 references
0.8922696
0 references
0.8861301
0 references
0.88613003
0 references
0.8812821
0 references
