An improved parameterized algorithm for a generalized matching problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4978 LNCS, Issue , 2008, Pages 212-222

  Wang, Jianxin ^a   Ning, Dan ^a   Feng, Qilong ^a   Chen, Jianer ^a  

^a CENTRAL SOUTH UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY;

KERNEL SIZE; KERNELIZATION; MATCHING PROBLEMS; PACKING PROBLEMS; PARAMETERIZED ALGORITHM; PARAMETERIZED COMPLEXITY; RUNNING TIME;

POLYNOMIALS;

EID: 70349319534     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-79228-4_19     Document Type: Conference Paper

References (8)

1. Hell, P.: Graph Packings. Electronic Notes in Discrete Mathematics 5 (2000)
2. Kirkpatrick, D.G., Hell, P.: On the complexity of general graph factor problems. SIAM J. Comput. 12, 601-609 (1983)
3. Kann, V.: Maximum bounded H-matching is MAX-SNP-complete. J. nform. Process. Lett. 49, 309-318 (1994)
4. Hurkens, C., Schrijver, A.: On the size of systems of sets every t of which have an SDR, with application to worst case ratio of Heuristics for packing problems. ISIAM J. Discrete Math. 2, 68-72 (1989)
5. Fellows, M., Heggernes, P., Rosamond, F., Sloper, C., Telle, J.A.: Exact algorithms for finding k disjoint triangles in an arbitrary graph. In: Hromkovič, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 235-244. Springer, Heidelberg (2004)
6. Mathieson, L., Prieto, E., Shaw, P.: Packing edge disjoint triangles: a parameterized view. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol. 3162, pp. 127-137. Springer, Heidelberg (2004)
7. Prieto, E., Sloper, C.: Look at the stars. Theoretical Computer Science 351, 437-445 (2006)
8. Chen, J.: Parameterized computation and complexity: a new approach dealing with NP-hardness. Journal of Computer Science and Technology 20, 18-37 (2005)