An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth (Q6201339)
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 7807473
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth |
scientific article; zbMATH DE number 7807473 |
Statements
An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth (English)
0 references
20 February 2024
0 references
fixed-parameter tractable algorithm
0 references
graph algorithm
0 references
spanning tree problems
0 references
treewidth
0 references
0.7606109380722046
0 references
0.755544126033783
0 references
0.7513793706893921
0 references
0.7513245344161987
0 references
0.7507307529449463
0 references
