1. http://www.maxsat.udl.cat/15/solvers/
2. Connected parts are determined by edges, which is straightforward for the vertex cover problem. For the Boolean satisfiability problem, we assume two different variables in any single clause are connected by an edge
3. In most cases, the determination of the site percolation threshold of the underlying graph relies on numerical approaches [31,60,56,57] (e.g., Monte Carlo simulations combined with a finite-size scaling analysis). Significant algorithmic progress has been made by Newman and Ziff [60] for calculating the cluster size distribution or spanning probability over the entire range of site or bond occupation probabilities from zero to one in one single run (scaling linearly in the number of sites). In some cases — such as random graphs [14] or triangular lattices [69] — it is even possible to derive the site percolation threshold analytically
4. http://www.maxsat.udl.cat/15/
5. https://www.cs.rochester.edu/u/kautz/walksat/