A graph polynomial for independent sets of bipartite graphs (Q2908853)
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 6073535
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A graph polynomial for independent sets of bipartite graphs |
scientific article; zbMATH DE number 6073535 |
Statements
29 August 2012
0 references
graph polynomials
0 references
\#P-complete
0 references
independent sets
0 references
approximate counting problems
0 references
Markov chain Monte Carlo
0 references
A graph polynomial for independent sets of bipartite graphs (English)
0 references
0.9357681274414062
0 references
0.8400861024856567
0 references
0.8230841755867004
0 references
0.8092153668403625
0 references
0.7994228601455688
0 references
