With the technical development of VLSI (very large scale integrated circuit), the constrained minimum vertex cover in bipartite graphs (Min-CVCB) for re-configurable arrays has attracted considerable attention in the literature.

An exact algorithm to improve the upper bound of vertex cover and independent set problem for low degree graphs is presented.

In WSN(Wireless Ad-hoc Sensor Network),some sensor nodes could die with their limited power consuming,which leads to the decrease of the point covering quality.

This paper discusses the point covering prob lem solved by ant-algorithm.

Using this method, we transfer a point covering problem into the object optimizing problem.

By using the vertex cover algorithm in graph theory and network analysing techniques in GPS, the paper explores method in determining critical road network junctions for the optimum location of non-intrusive sensors for real-time traffic monitoring and data collection.

The fault coverage problem for reconfigurable arrays has received as constraint bipartite vertex cover problem, which is proved as a NP-complete.

The algorithm of this paper solved vertex cover problem from another point of view.

This paper surveys the current research on OSN topologies and brings forward the overlay nodes placement problem(ONPP) and the service placement problem(SPP).

Surface-based DNA algorithm for minimal vertex covering problem

A VC algorithm to obtain the vertex covering of a graph is presented.

This paper mainly studies two variants of the vertex covering problem.