Streaming Deletion Problems Parameterized by Vertex Cover

Streaming is a model where an input graph provided one edge at time, instead of being able to inspect it will. In this work, we take parameterized approach by assuming vertex cover the given, building on work Bishnu et al. [COCOON 2020]. We show further potency combining parameter with Adjacency List streaming obtain results for deletion problems. This includes kernels, algorithms, and lower bounds problems \(\varPi \) -free Deletion, H more specific forms Cluster Vertex Deletion Odd Cycle Transversal. focus complexity in terms number passes over stream, memory used. leads pass/memory trade-off, different algorithm might be favourable depending context instance. also discuss implications non-streaming setting.