论文标题
一般2路径问题
General 2-path Problem
论文作者
论文摘要
在本文中，首先详细介绍了有关信号流图，F（z）上的线性时间不变系统和计算复杂性的一些初步。为了解决一般2路径问题的F（Z）上的必要条件，在F（Z）或R上的足够条件以及F（Z）上的F（Z）条件的足够条件分别进行了一般的2-Path问题。此外，在详细推导是否存在一般的2条路径上，对R是否存在足够和必要的条件。最后，引入了这种等效的足够和必要条件的算法的计算复杂性，因此这意味着一般的2路径问题是P问题。
In this paper, some preliminaries about signal flow graph, linear time-invariant system on F(z) and computational complexity are first introduced in detail. In order to synthesize the necessary and sufficient condition on F(z) for a general 2-path problem, the sufficient condition on F(z) or R and necessary conditions on F(z) for a general 2-path problem are secondly analyzed respectively. Moreover, an equivalent sufficient and necessary condition on R whether there exists a general 2-path is deduced in detail. Finally, the computational complexity of the algorithm for this equivalent sufficient and necessary condition is introduced so that it means that the general 2-path problem is a P problem.
