PyPI recent updates for varela

0.3.2

vega.frank@gmail.com — Thu, 02 Apr 2026 17:17:47 GMT

Compute the Approximate Vertex Cover for undirected graph encoded in DIMACS format.

0.3.1

vega.frank@gmail.com — Thu, 05 Jun 2025 20:34:25 GMT

Compute the Approximate Vertex Cover for undirected graph encoded in DIMACS format.

0.3.0

vega.frank@gmail.com — Thu, 05 Jun 2025 15:37:56 GMT

Compute the Approximate Vertex Cover for undirected graph encoded in DIMACS format.

0.2.9

vega.frank@gmail.com — Sat, 26 Apr 2025 22:29:43 GMT

Compute the Approximate Vertex Cover for undirected graph encoded in DIMACS format.

0.2.8

vega.frank@gmail.com — Fri, 25 Apr 2025 22:08:12 GMT

Compute the Approximate Vertex Cover for undirected graph encoded in DIMACS format.

0.2.7

vega.frank@gmail.com — Fri, 25 Apr 2025 20:10:52 GMT

Compute the Approximate Vertex Cover for undirected graph encoded in DIMACS format.

0.2.6

vega.frank@gmail.com — Fri, 25 Apr 2025 19:24:08 GMT

Compute the Approximate Vertex Cover for undirected graph encoded in DIMACS format.

0.2.5

vega.frank@gmail.com — Wed, 19 Mar 2025 09:56:05 GMT

Compute the Exact Minimum Vertex Cover for undirected graph encoded in DIMACS format.

0.2.4

vega.frank@gmail.com — Fri, 28 Feb 2025 18:43:13 GMT

Estimating the Minimum Vertex Cover with an approximation factor of at most 1.75 for undirected graph encoded in DIMACS format.

0.2.3

vega.frank@gmail.com — Thu, 27 Feb 2025 21:35:53 GMT

Estimating the Minimum Vertex Cover with an approximation factor of at most 1.75 for undirected graph encoded in DIMACS format.

0.2.2

vega.frank@gmail.com — Wed, 26 Feb 2025 07:11:37 GMT

Estimating the Minimum Vertex Cover with an approximation factor of less than 2 for undirected graph encoded in DIMACS format.

0.2.1

vega.frank@gmail.com — Tue, 25 Feb 2025 20:03:45 GMT

Estimating the Minimum Vertex Cover with an approximation factor of at most 1.9 for undirected graph encoded in DIMACS format.

0.2.0

vega.frank@gmail.com — Tue, 25 Feb 2025 17:02:58 GMT

Estimating the Minimum Vertex Cover with an approximation factor of at most 1.9 for undirected graph encoded in DIMACS format.

0.1.9

vega.frank@gmail.com — Tue, 25 Feb 2025 07:00:34 GMT

Estimating the Minimum Vertex Cover with an approximation factor less than 2 for undirected graph encoded in DIMACS format.

0.1.8

vega.frank@gmail.com — Mon, 24 Feb 2025 12:59:54 GMT

Estimating the Minimum Vertex Cover with an approximation factor less than 2 for undirected graph encoded in DIMACS format.

0.1.7

vega.frank@gmail.com — Mon, 24 Feb 2025 11:13:55 GMT

Estimating the Minimum Vertex Cover with an approximation factor less than 2 for undirected graph encoded in DIMACS format.

0.1.6

vega.frank@gmail.com — Tue, 18 Feb 2025 13:45:30 GMT

Estimating the Minimum Vertex Cover with an approximation factor less than 2 for undirected graph encoded in DIMACS format.

0.1.5

vega.frank@gmail.com — Sun, 16 Feb 2025 04:12:20 GMT

Estimating the Minimum Vertex Cover with an approximation factor at most 3/2 for undirected graph encoded in DIMACS format.

0.1.4

vega.frank@gmail.com — Sat, 15 Feb 2025 15:49:08 GMT

Estimating the Minimum Vertex Cover with an approximation factor of < √2 for large enough graph encoded in DIMACS format.

0.1.3

vega.frank@gmail.com — Sat, 15 Feb 2025 00:07:54 GMT

Estimating the Minimum Vertex Cover with an approximation factor of < 2 for an undirected graph encoded in DIMACS format.

0.1.2

vega.frank@gmail.com — Fri, 14 Feb 2025 21:48:07 GMT

Estimating the Minimum Vertex Cover with an approximation factor of < 2 for an undirected graph encoded in DIMACS format.

0.1.1

vega.frank@gmail.com — Fri, 14 Feb 2025 18:25:13 GMT

Estimating the Minimum Vertex Cover with an approximation factor of < 2 for an undirected graph encoded in DIMACS format.

0.1.0

vega.frank@gmail.com — Fri, 14 Feb 2025 07:44:03 GMT

Estimating the Minimum Vertex Cover with an approximation factor of ≤ 3/2 for an undirected graph encoded in DIMACS format.

0.0.9

vega.frank@gmail.com — Fri, 14 Feb 2025 07:29:26 GMT

Estimating the Minimum Vertex Cover with an approximation factor of ≤ 3/2 for an undirected graph encoded in DIMACS format.

0.0.8

vega.frank@gmail.com — Fri, 14 Feb 2025 07:12:49 GMT

Estimating the Minimum Vertex Cover with an approximation factor of ≤ 3/2 for an undirected graph encoded in DIMACS format.

0.0.7

vega.frank@gmail.com — Fri, 14 Feb 2025 01:54:31 GMT

Estimating the Minimum Vertex Cover with an approximation factor of ≤ 3/2 for an undirected graph encoded in DIMACS format and stored in a file.

0.0.6

vega.frank@gmail.com — Fri, 07 Feb 2025 19:29:58 GMT

Estimating the Minimum Vertex Cover with an approximation factor of ≤ 3/2 for an undirected graph encoded as a Boolean adjacency matrix stored in a file.

0.0.5

vega.frank@gmail.com — Fri, 07 Feb 2025 16:01:00 GMT

Estimating the Minimum Vertex Cover with an approximation factor of ≤ 3/2 for an undirected graph encoded as a Boolean adjacency matrix stored in a file.

0.0.4

vega.frank@gmail.com — Fri, 07 Feb 2025 15:08:07 GMT

Estimating the Minimum Vertex Cover with an approximation factor of ≤ 3/2 for an undirected graph encoded as a Boolean adjacency matrix stored in a file.

0.0.3

vega.frank@gmail.com — Wed, 05 Feb 2025 21:35:31 GMT

Estimating the Minimum Vertex Cover with an approximation factor of ≤ 7/5 for large enough undirected graphs encoded as a Boolean adjacency matrix stored in a file.

0.0.2

vega.frank@gmail.com — Wed, 05 Feb 2025 20:12:58 GMT

Estimating the Minimum Vertex Cover with an approximation factor of 7/5 for large enough undirected graphs encoded as a Boolean adjacency matrix stored in a file.

0.0.1

vega.frank@gmail.com — Wed, 05 Feb 2025 12:11:38 GMT

Estimating the Minimum Vertex Cover with an approximation factor of 7/5 for large enough undirected graphs encoded as a Boolean adjacency matrix stored in a file.