一般2-路径问题
General 2-path Problem
AI总结:
本文研究一般2-路径问题,通过分析F(z)与R上的充分、必要条件并推导R上的等价充要条件,给出多项式时间算法,证明该问题属于P类。
摘要:
本文首先详细介绍了关于信号流图、F(z)上线性时不变系统以及计算复杂性的若干预备知识。为了综合给出F(z)上一般2-路径问题的充要条件,其次分别分析了一般2-路径问题在F(z)或R上的充分条件以及在F(z)上的必要条件。此外,详细推导了R上是否存在一般2-路径的等价充要条件。最后,介绍了求解该等价充要条件的算法的计算复杂性,从而表明一般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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。