Streaming deletion problems parameterized by vertex cover
From MaRDI portal
Cites work
- Data streams: algorithms and applications.
- Finding odd cycle transversals.
- Fixed parameter tractability of graph deletion problems over data streams
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Graph distances in the streaming model: the value of space
- Hitting forbidden induced subgraphs on bounded treewidth graphs
- scientific article; zbMATH DE number 1507224 (Why is no real title available?)
- scientific article; zbMATH DE number 1424324 (Why is no real title available?)
- scientific article; zbMATH DE number 7650305 (Why is no real title available?)
- scientific article; zbMATH DE number 7759295 (Why is no real title available?)
- Independent sets in vertex-arrival streams
- Kernelization Lower Bounds by Cross-Composition
- Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams
- Maximum common induced subgraph parameterized by vertex cover
- On graph problems in a semi-streaming model
- On the complexity of k-SAT
- On the parameterized complexity of graph modification to first-order logic properties
- Parameterized algorithms
- Parameterized Streaming: Maximal Matching and Vertex Cover
- Preprocessing subgraph and minor problems: when does a small vertex cover help?
- Streaming kernelization
- The node-deletion problem for hereditary properties is NP-complete
- Towards a theory of parameterized streaming algorithms
Cited in
(3)
This page was built for publication: Streaming deletion problems parameterized by vertex cover
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2140522)
