Computing the number of \(k\)-component spanning forests of a graph with bounded treewidth (Q2314068)
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: Computing the number of \(k\)-component spanning forests of a graph with bounded treewidth |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the number of \(k\)-component spanning forests of a graph with bounded treewidth |
scientific article |
Statements
Computing the number of \(k\)-component spanning forests of a graph with bounded treewidth (English)
0 references
19 July 2019
0 references
spanning tree
0 references
spanning forest
0 references
bounded treewidth
0 references
dynamic programming
0 references
0 references
0 references
0 references
0 references
