Abstract
In this paper, we apply random methods to deal with several parameterized problems. For the Parameterized Weighted P3-Packing problem, by randomly partitioning the vertices in given graph, a tripartite graph can be obtained. We prove that the Parameterized Weighted P3-Packing problem can be solved in polynomial time on tripartite graphs. Based on the algorithm on tripartite graphs, a randomized parameterized algorithm of running time O⁎(32k) is given for the Parameterized Weighted P3-Packing problem. For the Parameterized Weighted Load Coloring problem, by randomly partitioning the vertices in given graph into two parts and studying the structure properties of the connected components in two parts, a randomized parameterized algorithm of running time O⁎(11.32k) is presented. For the Parameterized Claw-free Edge Deletion problem on Diamond-free Graphs, by combining random with branching methods, a parameterized algorithm of running time O⁎(2.42k) is given.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
