从边集合出发给出了计算有向基因组的圈图连通分支的线性时间算法。
An algorithm for computing the connected components of the cycle graph of the given two signed genomes is studied, which is more efficient than the primary algorithm.
这种集合管路中心可连通和控制九口油井。
Through this manifold center, nine Wells are connected and controlled.
我们提出了一个有效的方法组织这些节点分为不同的集合，每个集合的节点能够完全覆盖所有的目标，并且与网关节点连通。
An efficient approach is presented to organize the sensor nodes into different sets, each of which complete covers all the targets and remains connected to one of sinks.
应用推荐