Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Wool, Holden"'
Autor:
Jiang, Xinwen, Wool, Holden
An NP-complete graph decision problem, the "Multi-stage graph Simple Path" (abbr. MSP) problem, is introduced. The main contribution of this paper is a poly-time algorithm named the ZH algorithm for the problem together with the proof of its correctn
Externí odkaz:
http://arxiv.org/abs/2108.03877
