暂无分享,去创建一个
[1] R. Downey,et al. Parameterized Computational Feasibility , 1995 .
[2] Weijia Jia,et al. Vertex Cover: Further Observations and Further Improvements , 2001, J. Algorithms.
[3] Weijia Jia,et al. Improvement on vertex cover for low-degree graphs , 2000, Networks.
[4] Igor Razgon. Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3 , 2009, J. Discrete Algorithms.
[5] Fabrizio Grandoni,et al. Refined Memorisation for Vertex Cover , 2004, IWPEC.
[6] Rolf Niedermeier,et al. Upper Bounds for Vertex Cover Further Improved , 1999, STACS.
[7] Judy Goldsmith,et al. Nondeterminism Within P , 1993, SIAM J. Comput..
[8] Rolf Niedermeier,et al. On Efficient Fixed Parameter Algorithms for WEIGHTED VERTEX COVER , 2000, ISAAC.
[9] Michael R. Fellows,et al. An Improved Fixed-Parameter Algorithm for Vertex Cover , 1998, Inf. Process. Lett..
[10] M. Fellows,et al. An improved fixed parameter tractable algorithm for vertex cover , 1999 .
[11] Ge Xia,et al. Improved upper bounds for vertex cover , 2010, Theor. Comput. Sci..
[12] Akanksha Agrawal,et al. Vertex Cover Gets Faster and Harder on Low Degree Graphs , 2014, COCOON.
[13] Mingyu Xiao,et al. A refined algorithm for maximum independent set in degree-4 graphs , 2017, J. Comb. Optim..
[14] Mingyu Xiao. A Note on Vertex Cover in Graphs with Maximum Degree 3 , 2010, COCOON.
[15] Michael R. Fellows,et al. Parameterized complexity: A framework for systematically confronting computational intractability , 1997, Contemporary Trends in Discrete Mathematics.
[16] Ge Xia,et al. Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems , 2003, Algorithmica.
[17] Hiroshi Nagamochi,et al. Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs , 2013, Theor. Comput. Sci..