Faster deterministic algorithms for \textsc{Co-path Packing} and \textsc{Co-path/cycle Packing} (Q2091118)
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: Faster deterministic algorithms for \textsc{Co-path Packing} and \textsc{Co-path/cycle Packing} |
scientific article; zbMATH DE number 7610147
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Faster deterministic algorithms for \textsc{Co-path Packing} and \textsc{Co-path/cycle Packing} |
scientific article; zbMATH DE number 7610147 |
Statements
Faster deterministic algorithms for \textsc{Co-path Packing} and \textsc{Co-path/cycle Packing} (English)
0 references
31 October 2022
0 references
graph algorithms
0 references
parameterized complexity
0 references
branching algorithms
0 references
0 references
0 references
0 references
0.9269941
0 references
0.9120725
0 references
0.8981815
0 references
0.89169794
0 references
0.87763005
0 references
0.87143224
0 references
0.8701041
0 references
0 references
