Counting independent sets in graphs with bounded bipartite pathwidth (Q2301551)
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: Counting independent sets in graphs with bounded bipartite pathwidth |
scientific article; zbMATH DE number 7173308
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting independent sets in graphs with bounded bipartite pathwidth |
scientific article; zbMATH DE number 7173308 |
Statements
Counting independent sets in graphs with bounded bipartite pathwidth (English)
0 references
24 February 2020
0 references
Markov chain Monte Carlo algorithm
0 references
fully polynomial-time randomized approximation scheme
0 references
independent set
0 references
pathwidth
0 references
1.0000004
0 references
0.9449367
0 references
0.93732536
0 references
0.93700826
0 references
0 references
0.9334246
0 references
0.9229108
0 references
0.91819465
0 references
0.91718686
0 references
