On approximate preprocessing for domination and hitting subgraphs with connected deletion sets (Q2316936): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcss.2019.05.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2947622378 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4967164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization – Preprocessing with a Guarantee / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lossy kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization Lower Bounds Through Colors and IDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time data reduction for dominating set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential parameterized algorithms on bounded-genus graphs and <i>H</i> -minor-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for finding a dominating set of fixed size in degenerated graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Meta) Kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization and Sparseness: the case of Dominating Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight approximation bounds for dominating set on graphs of bounded arboricity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection Theorems for Systems of Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Tree Approximation via Iterative Randomized Rounding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234114 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lossy Kernels for Connected Dominating Set on Sparse Graphs / rank
 
Normal rank

Latest revision as of 03:09, 20 July 2024

scientific article
Language Label Description Also known as
English
On approximate preprocessing for domination and hitting subgraphs with connected deletion sets
scientific article

    Statements

    On approximate preprocessing for domination and hitting subgraphs with connected deletion sets (English)
    0 references
    0 references
    0 references
    0 references
    7 August 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    parameterized complexity
    0 references
    kernelization
    0 references
    vertex deletion problems
    0 references
    0 references