Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference22 articles.
1. An improved fixed parameter algorithm for vertex cover;Balasubramanian;Inform. Process. Lett.,1998
2. J. Cheetham, F. Dehne, A. Rau-Chaplin, U. Stege, P.J. Taillon, Solving large FPT problems on coarse grained parallel machines, J. Comput. System Sci., 2004, in press.
3. J. Chen, Introduction to Tractability and Approximability of Optimization Problems, Lecture Notes, Department of Computer Science, Texas A&M University, 2002, available at: http://faculty/cs.tamu.edu/chen/notes/opt.ps.
4. J. Chen, I.A. Kanj, On constrained minimum vertex covers of bipartite graphs: improved algorithms, Proceedings of the 27th International Workshop on Graph-Theoretical Concepts in Computer Science (WG’01), Lecture Notes in Computer Science, Vol. 2204, Springer, Heidelberg, 2001, pp. 55–65.
5. Vertex cover;Chen;J. Algorithms,2001
Cited by
37 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献