Approximately counting independent sets in bipartite graphs via graph containers (Q6074723)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7749552
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximately counting independent sets in bipartite graphs via graph containers |
scientific article; zbMATH DE number 7749552 |
Statements
Approximately counting independent sets in bipartite graphs via graph containers (English)
0 references
12 October 2023
0 references
approximate counting
0 references
\#BIS
0 references
independent sets
0 references
graph containers
0 references
0 references
0.8490922451019287
0 references
0.8151118755340576
0 references
0.7922574877738953
0 references
0.7784522771835327
0 references
0.7610331177711487
0 references
