A Python implementation of a standard vertex-cover branching algorithm is benchmarked against SageMath, but the claimed O(n·1.71^k) complexity is only empirically fitted and the experiments are under-specified.
Learning a formally verified control barrier function in stochastic environment,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity
A Python implementation of a standard vertex-cover branching algorithm is benchmarked against SageMath, but the claimed O(n·1.71^k) complexity is only empirically fitted and the experiments are under-specified.