Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth (Q2333222): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Jian-hua Tu / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Sheng Gui Zhang / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Bin Long Li / rank | |||
Normal rank | |||
Revision as of 10:11, 13 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth |
scientific article |
Statements
Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth (English)
0 references
12 November 2019
0 references
independent set
0 references
matching
0 references
treewidth
0 references
dynamic programming
0 references
