2 papers
cs.CG2026
NP-Hardness of Non-Crossing Hamiltonian Path and Cycle in Non-Planar Graphs
Randal Tuggle, Jack Snoeyink
We seek to disentangle the hardness of finding a Hamiltonian path or cycle from the hardness of finding a non-crossing path or cycle by giving a direct reduction from 3-SAT to the…
math.NA2020
Accelerating the Distributed Kaczmarz Algorithm by Strong Over-relaxation
Riley Borgard, Steven N. Harding, Haley Duba +4
The distributed Kaczmarz algorithm is an adaptation of the standard Kaczmarz algorithm to the situation in which data is distributed throughout a network represented by a tree. We…