Convert a Strongly Connected Directed Graph to a Black-and-White 3-SAT Problem by the Balatonboglár Model.

Gábor Kusper Csaba Biró

Published in: Algorithms (2020)

Keyphrases

directed graph
strongly connected
probabilistic model

black and white
random walk
sat problem

probability distribution
np complete

constraint satisfaction problems
phase transition