Approximating the directed path partition problem (Q6204168): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ic.2024.105150 / rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q129716500 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IC.2024.105150 / rank | |||
Normal rank | |||
Latest revision as of 19:27, 30 December 2024
scientific article; zbMATH DE number 7825553
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating the directed path partition problem |
scientific article; zbMATH DE number 7825553 |
Statements
Approximating the directed path partition problem (English)
0 references
27 March 2024
0 references
path partition
0 references
digraph
0 references
alternating walk
0 references
enlarging walk
0 references
path-cycle cover
0 references
approximation algorithm
0 references
0 references
0 references
0 references
0 references
