283 citations · 284 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2021
A Polynomial-Time Deterministic Algorithm for an NP-Complete Problem
Xinwen Jiang, Holden Wool
We introduce an NP-complete graph decision problem, the "Multi-stage graph Simple Path" (abbr. MSP) problem, which focuses on determining the existence of specific "global paths" i…
cs.DS2013★ 1 cited
A Polynomial Time Algorithm for the Hamilton Circuit Problem
Xinwen Jiang
In this paper, we introduce a so-called Multistage graph Simple Path (MSP) problem and show that the Hamilton Circuit (HC) problem can be polynomially reducible to the MSP problem.…