arcs and n nodes, the complexity of the algorithm is O(np), which is superior to the complexity of previously known algorithms.">
我们提出一个多项式时间的查询算法与或图 p 弧和 n 节点,算法的复杂性 O ( n p ) , 这是优于先前已知的算法的复杂性。