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.
Scalable attack graph generation using an agent-based model,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2025 1verdicts
REJECT 1roles
background 1polarities
unclear 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.