This project is designed and implemented to find the vertex cover of a randomly generated graph using the MiniSat SAT solver. For a brief understanding of the vertex cover concept, refer to this link.

This project implements an algorithm to find the Minimum Vertex Cover of an undirected graph using Maximum Satisfiability (MaxSAT). The program is written in Java and operates in two modes: reading ...

Graph cover problems form a critical area within discrete optimisation and theoretical computer science, addressing the challenge of selecting subsets of vertices (or edges) that satisfy ...

1. Introduction All graphs we deal with are undirected, finite and simple. Let be any regular graph, and let be a collection of subgraphs (pages) of. The collection is an orthogonal double cover (ODC) ...

The vertex cover problem is a classical graph optimization problem which remains intractable even for cubic graphs and planar graphs with maximum degree at most three. In this paper, the exact ...