Computer Science ›› 2007, Vol. 34 ›› Issue (10): 173-176.

Previous Articles     Next Articles

CHANG Le WANG, Jian-Xin, CHEN Jian-Er (School of Information Science and Engineering, Central South University, Changsha 410083)   

  • Online:2018-11-16 Published:2018-11-16

Abstract: Crown reduction and NT algorithm had been thought tion of the parameterized Vertex Cover problem. NT algorithm to be two different approaches of great use in kernelizadivides a given graph into three parts called V0 ,V1 and V1/z removes V0 and V1 from the

Key words: Vertex cover, Parameterized computation, Kernelization algorithms, Crown reduction, NT algorithm

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!