Quick but Odd Growth of Cacti

Quick but Odd Growth of Cacti

0.00 Avg rating0 Votes
Article ID: iaor20173043
Volume: 79
Issue: 1
Start Page Number: 271
End Page Number: 290
Publication Date: Sep 2017
Journal: Algorithmica
Authors: , , ,
Keywords: graphs, heuristics
Abstract:

Let F equ1 be a family of graphs. Given an n‐vertex input graph G and a positive integer k, testing whether G has a vertex subset S of size at most k, such that G S equ2 belongs to F equ3 , is a prototype vertex deletion problem. These type of problems have attracted a lot of attention in recent times in the domain of parameterized complexity. In this paper, we study two such problems; when F equ4 is either the family of forests of cacti or the family of forests of odd‐cacti. A graph H is called a forest of cacti if every pair of cycles in H intersect on at most one vertex. Furthermore, a forest of cacti H is called a forest of odd cacti, if every cycle of H is of odd length. Let us denote by C equ5 and Codd equ6 , the families of forests of cacti and forests of odd cacti, respectively. The vertex deletion problems corresponding to C equ7 and Codd equ8 are called Diamond Hitting Set and Even Cycle Transversal, respectively. In this paper we design randomized algorithms with worst case run time 12 k n O ( 1 ) equ9 for both these problems. Our algorithms considerably improve the running time for Diamond Hitting Set and Even Cycle Transversal, compared to what is known about them.

Reviews

Required fields are marked *. Your email address will not be published.