Fixed parameter tractability of graph deletion problems over data streams
type: Item
instance of: scholarly article
title: Fixed parameter tractability of graph deletion problems over data streams
DOI: 10.1007/978-3-030-58150-3_53
author: Arijit Bishnu
author: Arijit Ghosh
author: Sudeshna Kolay
author: Gopinath Mishra
author: Saket Saurabh
publication date: 2021-04-21T00:00:00Z
Mathematics Subject Classification ID: 68Rxx
zbMATH DE Number: 7336142
MaRDI profile type: Publication
full work available at URL: 978-3-030-58150-3 53
OpenAlex ID: W3081687943
cites work: Tight bounds for single-pass streaming complexity of the set cover problem
cites work: Structural results on matching estimation with applications to streaming
cites work: Towards a theory of parameterized streaming algorithms
cites work: Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams
cites work: Parameterized Streaming: Maximal Matching and Vertex Cover
cites work: Q5091196
cites work: The sparse awakens: Streaming algorithms for matching size estimation in sparse graphs
cites work: Parameterized Algorithms
cites work: Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond
cites work: Streaming Kernelization
cites work: Preprocessing subgraph and minor problems: when does a small vertex cover help?
cites work: Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph
cites work: (1 + Ω(1))-Αpproximation to MAX-CUT Requires Linear Space
cites work: Planar Matching in Streams Revisited
cites work: Q5240429
description: scientific article; zbMATH DE number 7336142