Improvement on Vertex Cover for Low-Degree Graphs
暂无分享,去创建一个
[1] Robert E. Tarjan,et al. Finding a Maximum Independent Set , 1976, SIAM J. Comput..
[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[3] R. Downey,et al. Parameterized Computational Feasibility , 1995 .
[4] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[5] Leslie E. Trotter,et al. Vertex packings: Structural properties and algorithms , 1975, Math. Program..
[6] Michael R. Fellows,et al. An Improved Fixed-Parameter Algorithm for Vertex Cover , 1998, Inf. Process. Lett..
[7] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .
[8] John Michael Robson,et al. Algorithms for Maximum Independent Sets , 1986, J. Algorithms.
[9] Weijia Jia,et al. Vertex Cover: Further Observations and Further Improvements , 1999, J. Algorithms.
[10] Judy Goldsmith,et al. Nondeterminism Within P , 1993, SIAM J. Comput..