Solving Co-Path/Cycle Packing and Co-Path Packing faster than \(3^k\) (Q6841906)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8174451
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving Co-Path/Cycle Packing and Co-Path Packing faster than \(3^k\) |
scientific article; zbMATH DE number 8174451 |
Statements
Solving Co-Path/Cycle Packing and Co-Path Packing faster than \(3^k\) (English)
0 references
20 March 2026
0 references
graph algorithms
0 references
parameterized algorithms
0 references
Co-Path/Cycle Packing
0 references
Co-Path Packing
0 references
cut \& count
0 references
path decomposition
0 references
0 references
