17 projects
aegypti
Solve the Triangle-Free Problem for an undirected graph encoded in DIMACS format.
esperanza
Compute the Approximate Independent Set for undirected graph encoded in DIMACS format.
siriaisa
Compute the Approximate Independent Dominating Set for an undirected graph encoded in DIMACS format.
hittingset
Solve the Hitting Set problem in polynomial time via a weighted planar IDS reduction.
furones
Compute the Approximate Minimum Dominating Set for undirected graph encoded in DIMACS format.
salvador
Compute an approximate vertex cover for an undirected graph encoded in DIMACS format.
hvala
Compute the Approximate Vertex Cover for undirected graph encoded in DIMACS format.
hallelujah
Compute the Approximate Vertex Cover for undirected graph encoded in DIMACS format.
varela
Compute the Approximate Vertex Cover for undirected graph encoded in DIMACS format.
adonai
Compute the Approximate Chromatic Number for undirected graph encoded in DIMACS format.
movie-clustering
Movie catalog clustering using vertex cover feature selection
gump
Compute the Approximate Clique for undirected graph encoded in DIMACS format.
alonso
Compute an Approximate Vertex Cover for undirected graph encoded in DIMACS format.
mendive
Solve the Claw-Free Problem for an undirected graph encoded in DIMACS format.
loynaz
Compute the Approximate Edge Dominating Set for undirected graph encoded in DIMACS format.
capablanca
Find a 2-Approximate Dominating Set for undirected graph encoded in DIMACS format.
baldor
Solve the Approximate Minimum Dominating Set for undirected graph encoded in DIMACS format.
