On the construction of graphs with a planar bipartite double cover from Boolean formulas and its application to counting satisfying solutions (Q1704571)
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: On the construction of graphs with a planar bipartite double cover from Boolean formulas and its application to counting satisfying solutions |
scientific article; zbMATH DE number 6848998
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the construction of graphs with a planar bipartite double cover from Boolean formulas and its application to counting satisfying solutions |
scientific article; zbMATH DE number 6848998 |
Statements
On the construction of graphs with a planar bipartite double cover from Boolean formulas and its application to counting satisfying solutions (English)
0 references
12 March 2018
0 references
planar graph
0 references
bipartite double cover
0 references
perfect matchings
0 references
permanent
0 references
counting satisfying solutions
0 references
0 references
0 references
0.7931883931159973
0 references
0.7769020199775696
0 references
0.7631447315216064
0 references
0.7631447315216064
0 references
0.7611196041107178
0 references
