1) path covering number
路覆盖数
1.
We firstly gave the relationship between the path covering number of the complement Gc of G and the path covering number of the complement graphs of the connect components of G-S.
通过找出图G的补图Gc的路覆盖数与其子图G-S的各个连通分支补图的路覆盖数间的关系,在图G的λ数与其补图Gc的路覆盖数之间关系的基础上,给出图G的λ数与子图G-S的各个连通分支补图的路覆盖数之间的关系(这里S是G的一个k-顶点割)。
2) Closed walk covering number
闭通路覆盖数
3) Path coverage
路径覆盖
1.
This algorithm transports the pending issue into the study on the force laws to govern the interaction between centroid-centroid and centroid-trackpoint,in order to maximize path coverage while minimizing the overlapping sensing area among multiple neighboring video nodes,thus achieve better path coverage rate.
基于方向可调感知模型,本文提出一种基于虚拟势场的路径覆盖增强算法(PFPCE)。
2.
Path coverage is a kind of important standard that investigates the sufficiency of software testing,it requires that every branch in a program should be performed at least once.
路径覆盖是考察软件测试充分性的一种重要准则,它使程序的每个分支至少执行一次。
3.
A novel method for automatic generating simulation vectors from HDL descriptions based on path coverage and constraint solving is presented.
提出和实现了一种面向HDL描述基于路径覆盖的模拟矢量自动生成方法 。
4) overlay routing
覆盖路由
1.
Applying IPSec in overlay routing using technology of SPINAT;
利用SPINAT技术在覆盖路由中应用IPSec
2.
This paper surveys related research work of Internet overlay routing, and focuses on the structure and methods of Internet overlay routing on network layer and transport layer according to Internet layering scheme.
对互联网覆盖路由相关研究工作进行了调研;按照Internet分层概念重点考查了网络层和传输层的覆盖路由的结构和方法;并且考查了覆盖路由其他相关问题的研究,包括覆盖路由性能的影响因素、多个覆盖网络路由之间的相互作用等。
5) path cover
路覆盖
1.
In this paper,by using the so-called vertex disjoint path cover introduced by Reed,we prove that the domination number is at most 514n for the graphs of minimum degree at least five.
运用 Reed引进的顶点不交的路覆盖 ,找出图 G的一个控制集并估算这个控制集的基数 ,结合估算结果 ,证明如果图 G的最小度至少是 5 ,则图 G有基数至多是 514 n的控制集 。
补充资料：数不胜数
1.数也数不清。形容很多。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条