An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth (Q6201339): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q129496685, #quickstatements; #temporary_batch_1724872475876 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q129496685 / rank | |||
Normal rank | |||
Revision as of 20:24, 28 August 2024
scientific article; zbMATH DE number 7807473
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
