Sequential Monte Carlo for counting vertex covers in general graphs (Q294226)
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: Sequential Monte Carlo for counting vertex covers in general graphs |
scientific article; zbMATH DE number 6591370
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sequential Monte Carlo for counting vertex covers in general graphs |
scientific article; zbMATH DE number 6591370 |
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
0 references
0 references
0 references
0.7668142318725586
0 references
0.7564448118209839
0 references
0.7493433356285095
0 references
