Small vertex cover helps in fixed-parameter tractability of graph deletion problems over data streams (Q6185609): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s00224-023-10136-w / rank
Normal rank
 
Property / cites work
 
Property / cites work: Tight bounds for single-pass streaming complexity of the set cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural results on matching estimation with applications to streaming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability of graph modification problems for hereditary properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Streaming: Maximal Matching and Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5091196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sparse awakens: Streaming algorithms for matching size estimation in sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval Deletion Is Fixed-Parameter Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chordal editing is fixed-parameter tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preprocessing subgraph and minor problems: when does a small vertex cover help? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Streaming Kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hitting Forbidden Minors: Approximation and Kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: (1 + Ω(1))-Αpproximation to MAX-CUT Requires Linear Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster deterministic \textsc{Feedback Vertex Set} / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chordal deletion is fixed-parameter tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Matching in Streams Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5240429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding odd cycle transversals. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Bounds for Graph Problems in Insertion Streams / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 4 <i>k</i> <sup>2</sup> kernel for feedback vertex set / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00224-023-10136-W / rank
 
Normal rank

Latest revision as of 19:15, 30 December 2024

scientific article; zbMATH DE number 7784968
Language Label Description Also known as
English
Small vertex cover helps in fixed-parameter tractability of graph deletion problems over data streams
scientific article; zbMATH DE number 7784968

    Statements

    Small vertex cover helps in fixed-parameter tractability of graph deletion problems over data streams (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    8 January 2024
    0 references
    FPT
    0 references
    streaming algorithms
    0 references
    vertex cover
    0 references
    subgraph deletion problems
    0 references
    minor deletion problems
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references