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…