The 1-fixed-endpoint path cover problem is Polynomial on interval graphs (Q1957649): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s00453-009-9292-5 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00453-009-9292-5 / rank | |||
Normal rank | |||
Latest revision as of 15:25, 16 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The 1-fixed-endpoint path cover problem is Polynomial on interval graphs |
scientific article |
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
