Abstract
Parameterized algorithms are presented for the weighted P 2-Packing problem, which is a generalization of the famous Graph Matching problem. The algorithms are based on the following new techniques and observations: (1) new study on structure relationship between graph matchings in general graphs and P2-packings in bipartite graphs; (2) an effective graph bi-partitioning algorithm; and (3) a polynomial-time algorithm for a constrained weighted P2-Packing problem in bipartite graphs. These techniques lead to randomized and deterministic parameterized algorithms that significantly improve the previous best upper bounds for the problem for both weighted and unweighted versions. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Feng, Q., Wang, J., & Chen, J. (2011). Matching and P2-packing: Weighted versions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6842 LNCS, pp. 343–353). https://doi.org/10.1007/978-3-642-22685-4_31
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
