Login / Signup

Small Vertex Cover Helps in Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams.

Arijit BishnuArijit GhoshSudeshna KolayGopinath MishraSaket Saurabh
Published in: Theory Comput. Syst. (2023)
Keyphrases
  • vertex cover
  • data streams
  • approximation algorithms
  • planar graphs
  • random walk
  • np hard
  • dynamic programming
  • precedence constraints