Fixed Parameter Tractability of Graph Deletion Problems over Data Streams

Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

The study of parameterized streaming complexity on graph problems was initiated by Fafianie et al. (MFCS’14) and Chitnis et al. (SODA’15 and SODA’16). In this work, we initiate a systematic study of parameterized streaming complexity of graph deletion problems – -Subgraph deletion, -Minor deletion in the four most well-studied streaming models: the (edge arrival), (dynamic edge arrival), (vertex arrival) and Al (adjacency list) models. Our main conceptual contribution is to overcome the obstacles to efficient parameterized streaming algorithms by utilizing the power of parameterization. We focus on the vertex cover size K as the parameter for the parameterized graph deletion problems we consider. At the same time, most of the previous work in parameterized streaming complexity was restricted to the Ea (edge arrival) or Dea (dynamic edge arrival) models. In this work, we consider the four most well-studied streaming models: the Ea, Dea, Va (vertex arrival) and Al (adjacency list) models.

Original languageEnglish
Title of host publicationComputing and Combinatorics - 26th International Conference, COCOON 2020, Proceedings
EditorsDonghyun Kim, R.N. Uma, Zhipeng Cai, Dong Hoon Lee
PublisherSpringer Science and Business Media Deutschland GmbH
Pages652-663
Number of pages12
ISBN (Print)9783030581497
DOIs
StatePublished - 1 Jan 2020
Externally publishedYes
Event26th International Conference on Computing and Combinatorics, COCOON 2020 - Atlanta, United States
Duration: 29 Aug 202031 Aug 2020

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12273 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference26th International Conference on Computing and Combinatorics, COCOON 2020
Country/TerritoryUnited States
CityAtlanta
Period29/08/2031/08/20

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Fixed Parameter Tractability of Graph Deletion Problems over Data Streams'. Together they form a unique fingerprint.

Cite this