Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams

06/13/2019
by   Arijit Bishnu, et al.
0

In this work, we initiate a systematic study of parameterized streaming complexity of graph deletion problems: F-Subgraph Deletion, F-Minor Deletion and Cluster Vertex Deletion in the four most well-studied streaming models: the EA (edge arrival), DEA (dynamic edge arrival), VA (vertex arrival) and AL (adjacency list) models. We also consider the streaming complexities of a collection of widely-studied problems that are special variants of F-Subgraph Deletion, namely Feedback Vertex Set, Even Cycle Transversal, Odd Cycle Transversal, Triangle Deletion, and Cluster Vertex Deletion. Except for the Triangle Deletion and Cluster Vertex Deletion problems, we show that none of the other problems have space-efficient streaming algorithms when the problems are parameterized by k, the solution size. In fact, we show that these problems admit Ω(n n) lower bounds in all the four models stated above. This improves the lower bounds given by Chitnis et al. (SODA'16) for the EA model. For the Triangle Deletion and Cluster Vertex Deletion problems, the question of lower bounds for the problems parameterized by k is open for the AL model. For all other models, we show an improved lower bound of Ω(n n) for Triangle Deletion. With regards to Cluster Vertex Deletion, we extend the results of Chitnis et al. (SODA'16) in the EA model to the DEA and VA models. We exploit the power of parameterization - a usual approach taken in parameterized algorithms - to study a problem with respect to parameters greater than the solution size or consider some structural parameters. Parameterized by vertex cover size K, some of these problems on some of the graph streaming models do not admit space-efficient streaming algorithms, while it does so for others

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/13/2019

Structural Parameterization for Graph Deletion Problems over Data Streams

The study of parameterized streaming complexity on graph problems was in...
research
11/19/2021

Streaming Deletion Problems Parameterized by Vertex Cover

Streaming is a model where an input graph is provided one edge at a time...
research
08/03/2023

Meta-theorems for Parameterized Streaming Algorithms

The streaming model was introduced to parameterized complexity independe...
research
07/11/2022

Parameterized Complexity of Streaming Diameter and Connectivity Problems

We initiate the investigation of the parameterized complexity of Diamete...
research
04/19/2020

Preprocessing Vertex-Deletion Problems: Characterizing Graph Properties by Low-Rank Adjacencies

We consider the Π-free Deletion problem parameterized by the size of a v...
research
02/23/2020

Structural Parameterizations with Modulator Oblivion

It is known that problems like Vertex Cover, Feedback Vertex Set and Odd...
research
08/11/2023

Lossy Kernelization for (Implicit) Hitting Set Problems

We re-visit the complexity of kernelization for the d-Hitting Set proble...

Please sign up or login with your details

Forgot password? Click here to reset