Sequential Monte Carlo for counting vertex covers in general graphs (Q294226): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:10, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sequential Monte Carlo for counting vertex covers in general graphs |
scientific article |
Statements
Sequential Monte Carlo for counting vertex covers in general graphs (English)
0 references
10 June 2016
0 references
vertex cover
0 references
counting problem
0 references
sequential importance sampling
0 references
dynamic programming
0 references
relaxation
0 references
random graphs
0 references
