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.

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.

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.

A novel method for automatic generating simulation vectors from HDL descriptions based on path coverage and constraint solving is presented.

Applying IPSec in overlay routing using technology of SPINAT;

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.

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.

To cope with problems such as the number of path is huge and path coverage can hardly increase rapidly.

The authors developed a validation platform of automatic simulation vectors generation based on the path coverage metric using genetic algorithm for RT-level designs.