An Improved Parameterized Algorithm for a Generalized Matching Problem
暂无分享,去创建一个
[1] Ann Carr-Boyd. Look at the Stars , 2005 .
[2] David G. Kirkpatrick,et al. On the Complexity of General Graph Factor Problems , 1981, SIAM J. Comput..
[3] Peter Shaw,et al. Packing Edge Disjoint Triangles: A Parameterized View , 2004, IWPEC.
[4] Jian-Er Chen,et al. Parameterized Computation and Complexity: A New Approach Dealing with NP-Hardness , 2005, Journal of Computer Science and Technology.
[5] Michael R. Fellows,et al. Finding k Disjoint Triangles in an Arbitrary Graph , 2004, WG.
[6] Christian Sloper,et al. Looking at the stars , 2004, Theor. Comput. Sci..
[7] Alexander Schrijver,et al. On the Size of Systems of Sets Every t of Which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems , 1989, SIAM J. Discret. Math..
[8] Michael A. Langston,et al. Parameterized and Exact Computation, Second International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006, Proceedings , 2006, IWPEC.
[9] Viggo Kann,et al. Maximum Bounded H-Matching is MAX SNP-Complete , 1994, Inf. Process. Lett..