A linear‐time algorithm for the <i>k</i>‐fixed‐endpoint path cover problem on cographs (Q5434590): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1002/net.20200 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/NET.20200 / rank | |||
Normal rank | |||
Latest revision as of 17:00, 30 December 2024
scientific article; zbMATH DE number 5223726
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear‐time algorithm for the <i>k</i>‐fixed‐endpoint path cover problem on cographs |
scientific article; zbMATH DE number 5223726 |
Statements
A linear‐time algorithm for the <i>k</i>‐fixed‐endpoint path cover problem on cographs (English)
0 references
7 January 2008
0 references
perfect graphs
0 references
complement reducible graphs
0 references
cographs
0 references
cotree
0 references
path cover
0 references
fixed-endpoint path cover
0 references
linear-time algorithms
0 references
