TY - GEN
T1 - Fixed Parameter Tractability of Graph Deletion Problems over Data Streams
AU - Bishnu, Arijit
AU - Ghosh, Arijit
AU - Kolay, Sudeshna
AU - Mishra, Gopinath
AU - Saurabh, Saket
N1 - Publisher Copyright:
© 2020, Springer Nature Switzerland AG.
PY - 2020/1/1
Y1 - 2020/1/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85091070407&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-58150-3_53
DO - 10.1007/978-3-030-58150-3_53
M3 - Conference contribution
AN - SCOPUS:85091070407
SN - 9783030581497
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 652
EP - 663
BT - Computing and Combinatorics - 26th International Conference, COCOON 2020, Proceedings
A2 - Kim, Donghyun
A2 - Uma, R.N.
A2 - Cai, Zhipeng
A2 - Lee, Dong Hoon
PB - Springer Science and Business Media Deutschland GmbH
T2 - 26th International Conference on Computing and Combinatorics, COCOON 2020
Y2 - 29 August 2020 through 31 August 2020
ER -