alonso 0.0.7__py3-none-any.whl → 0.0.8__py3-none-any.whl

alonso/app.py

@@ -82,7 +82,7 @@ def main():
     helper.add_argument('-c', '--count', action='store_true', help='calculate the size of the vertex cover')
     helper.add_argument('-v', '--verbose', action='store_true', help='anable verbose output')
     helper.add_argument('-l', '--log', action='store_true', help='enable file logging')
-    helper.add_argument('--version', action='version', version='%(prog)s 0.0.7')
+    helper.add_argument('--version', action='version', version='%(prog)s 0.0.8')
     
     # Initialize the parameters
     args = helper.parse_args()

alonso/batch.py

@@ -36,7 +36,7 @@ def main():
     helper.add_argument('-c', '--count', action='store_true', help='calculate the size of the vertex cover')
     helper.add_argument('-v', '--verbose', action='store_true', help='anable verbose output')
     helper.add_argument('-l', '--log', action='store_true', help='enable file logging')
-    helper.add_argument('--version', action='version', version='%(prog)s 0.0.7')
+    helper.add_argument('--version', action='version', version='%(prog)s 0.0.8')
 
     
     # Initialize the parameters

alonso/test.py

@@ -34,7 +34,7 @@ def main():
     helper.add_argument('-w', '--write', action='store_true', help='write the generated random matrix to a file in the current directory')
     helper.add_argument('-v', '--verbose', action='store_true', help='anable verbose output')
     helper.add_argument('-l', '--log', action='store_true', help='enable file logging')
-    helper.add_argument('--version', action='version', version='%(prog)s 0.0.7')
+    helper.add_argument('--version', action='version', version='%(prog)s 0.0.8')
     
     # Initialize the parameters
     args = helper.parse_args()

{alonso-0.0.7.dist-info → alonso-0.0.8.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: alonso
-Version: 0.0.7
+Version: 0.0.8
 Summary: Compute an Approximate Vertex Cover for undirected graph encoded in DIMACS format.
 Home-page: https://github.com/frankvegadelgado/alonso
 Author: Frank Vega
@@ -69,7 +69,7 @@ Given an undirected graph $G = (V, E)$, a **vertex cover** is a subset $V' \subs
 
 # Overview of the Algorithm and Its Running Time
 
-The `find_vertex_cover` algorithm approximates a minimum vertex cover for an undirected graph $G = (V, E)$ by partitioning its edges into two claw-free subgraphs using the Burr-Erdős-Lovász (1976) method, computing exact vertex covers for these subgraphs with the Faenza, Oriolo, and Stauffer (2011) approach, and recursively refining the solution on residual edges. This process prevents the ratio from reaching 2, leveraging overlap between subgraphs and minimal additions in recursion. The algorithm begins by cleaning the graph (removing self-loops and isolates in $O(n + m)$), checking for claw-free in $O(m \cdot \Delta)$ where $\Delta$ is the maximum degree, partitions edges in $O(n^3)$, computes vertex covers in $O(n^3)$ per subgraph (total $O(n^3)$), merges covers in $O(n \cdot \log n)$, and constructs the residual graph in $O(m)$. The recursive nature, with a worst-case depth of $O(m)$ if each step covers one edge, yields a total runtime of $O(n^3 m)$, dominated by the cubic cost across levels. For sparse graphs ($m = O(n)$), this simplifies to $O(n^4)$.
+The `find_vertex_cover` algorithm approximates a minimum vertex cover for an undirected graph $G = (V, E)$ by partitioning its edges into two claw-free subgraphs using the Burr-Erdős-Lovász (1976) method, computing exact vertex covers for these subgraphs with the Faenza, Oriolo, and Stauffer (2011) approach, and recursively refining the solution on residual edges. This process prevents the ratio from reaching 2, leveraging overlap between subgraphs and minimal additions in recursion. The algorithm begins by cleaning the graph (removing self-loops and isolates in $\mathcal{O}(n + m)$), checking for claw-free in $\mathcal{O}(m \cdot \Delta)$ where $\Delta$ is the maximum degree, partitions edges in $\mathcal{O}(n^3)$, computes vertex covers in $\mathcal{O}(n^3)$ per subgraph (total $\mathcal{O}(n^3)$), merges covers in $\mathcal{O}(n \cdot \log n)$, and constructs the residual graph in $\mathcal{O}(m)$. The recursion depth never exceeds a small constant, most commonly 2. This yields a total runtime of $\mathcal{O}(n^3)$, per a constant time of recursion levels.
 
 ---
 

{alonso-0.0.7.dist-info → alonso-0.0.8.dist-info}/RECORD

@@ -1,17 +1,17 @@
 alonso/__init__.py,sha256=xFbWJ7kskxYZCWD3QWtJ6d9uGnDlqhJyFJDCVuqG7hE,207
 alonso/algorithm.py,sha256=QqSdBTIPtLxAVoCtCmlTTlflJafjsbA00AKMRehKoOE,5241
-alonso/app.py,sha256=GvSjQNfwAuBw6Wjw6Mv6OaDzstw3XPyLpu72FKDPMJU,4320
+alonso/app.py,sha256=W4lRbazSIy5zqNZUZmEgQ-7qGlQnczw2AwV6_6EDlcA,4320
 alonso/applogger.py,sha256=fQBo51-TboX1DBqfSxX2P2eKJ5CcyiCq_IVlJTHjxAE,2624
-alonso/batch.py,sha256=a_jbgkPEmn9w4bYn4oK9js5HYsNrs31sgbbp65b-rLQ,2305
+alonso/batch.py,sha256=6Q9m_H_zj-eiG_qd7As856C--pzBFckpX8_N3zLT7qc,2305
 alonso/merge.py,sha256=dWhF9t_2bFp4HT1NCzjhrSlhm8CkJQ4pwBHOhHSkezQ,4257
 alonso/parser.py,sha256=Ib4TnWdkQb6A6FA3HHEjZDBb7uD0v9Gabwewqfu4XpQ,2549
 alonso/partition.py,sha256=iDtuIkLyBTf8Cg-nceYDgLlWWQ2mLGrm-J3fmnz0j5I,8114
 alonso/stable.py,sha256=IwINwjd3F7dfoISXlWsNWRkVJzItEojgMyNwzMM7nYc,6577
-alonso/test.py,sha256=BWDBANpSnDRY9J2mj8L4-RCEtMt_pgu_gCkJ531L2fY,5472
+alonso/test.py,sha256=f-L8SlJfRlnbu9_EV-8m8b7X9eobBxH3VX2JN9eU0U8,5472
 alonso/utils.py,sha256=RmctLB8oDtjf0wKcKFaRvXiRgmtegqfbB1HFFzlpsvE,7674
-alonso-0.0.7.dist-info/licenses/LICENSE,sha256=nUDh1nfa7rfEv1HocpoqPu0JaFnZKpIVh9eM0MgozpM,1067
-alonso-0.0.7.dist-info/METADATA,sha256=CC2QC_LmSuHb_-rOPY3V5B1pN2t4Q_LjzUFOPUrTfks,9290
-alonso-0.0.7.dist-info/WHEEL,sha256=_zCd3N1l69ArxyTb8rzEoP9TpbYXkqRFSNOD5OuxnTs,91
-alonso-0.0.7.dist-info/entry_points.txt,sha256=JSod2CWtklhiaOFW3masqrgqhXIpVRsbIiprSmS1P7g,98
-alonso-0.0.7.dist-info/top_level.txt,sha256=rOo7SlpYGdic6g55rHDus2d5N2t74H9qamX4yi6z5vw,7
-alonso-0.0.7.dist-info/RECORD,,
+alonso-0.0.8.dist-info/licenses/LICENSE,sha256=nUDh1nfa7rfEv1HocpoqPu0JaFnZKpIVh9eM0MgozpM,1067
+alonso-0.0.8.dist-info/METADATA,sha256=LdX28VgfNlpHcpkq4Y1xM4UuRCv7jTwX2hN1ca4FEos,9293
+alonso-0.0.8.dist-info/WHEEL,sha256=_zCd3N1l69ArxyTb8rzEoP9TpbYXkqRFSNOD5OuxnTs,91
+alonso-0.0.8.dist-info/entry_points.txt,sha256=JSod2CWtklhiaOFW3masqrgqhXIpVRsbIiprSmS1P7g,98
+alonso-0.0.8.dist-info/top_level.txt,sha256=rOo7SlpYGdic6g55rHDus2d5N2t74H9qamX4yi6z5vw,7
+alonso-0.0.8.dist-info/RECORD,,