Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth (Q2333222): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.amc.2018.03.017 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2794749612 / rank | |||
Normal rank | |||
Revision as of 02:01, 20 March 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
