1. reduction in cost of the hare
... a) in the cover or b) all its neighbors most be in set. The time to find the exact set, O (2^k n); k set number, n number of vertices. For a fixed parameter k, deciding whether a graph has a Vertex Cover, of k or less, the "worst case" algorithm takes linear time. Moreover, new techniques that are emerging in the realm of Fixed Parameter Tractability led to an O (1.271^k + n^2) time algorithm ... an address counter. In addition, two Dual Port RAM Cores, generated by Xilinx's CoreGen software were needed for the design. The objective of this PILOT was not to find the Vertex Cover of a gr...
- Word Count: 1601
- Approx Pages: 6
- Grade Level: High School