Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth (Q2333222): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.amc.2018.03.017 / rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q130060574 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.AMC.2018.03.017 / rank | |||
Normal rank | |||
Latest revision as of 01:25, 18 December 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
0 references
0 references
