Login / Signup

On the construction of graphs with a planar bipartite double cover from boolean formulas and its application to counting satisfying solutions.

Christian Schridde
Published in: Theor. Comput. Sci. (2018)
Keyphrases
  • bipartite graph
  • graph model
  • boolean formula
  • optimal solution
  • machine learning
  • search space
  • dynamic programming
  • undirected graph