A linear kernel for a planar connected dominating set (Q534569): 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.tcs.2010.10.045 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2177196747 / 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: (Meta) Kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Kernel for Planar Feedback Vertex Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Kernel for the k-Disjoint Cycle Problem on Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex Cover: Further Observations and Further Improvements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving connected dominating set faster than \(2^n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bidimensionality and Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: `` Strong '' NP-Completeness Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for connected dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Problem Kernels for NP-Hard Problems on Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parameterized Complexity of the Induced Matching Problem in Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633817 / rank
 
Normal rank

Latest revision as of 02:15, 4 July 2024

scientific article
Language Label Description Also known as
English
A linear kernel for a planar connected dominating set
scientific article

    Statements

    A linear kernel for a planar connected dominating set (English)
    0 references
    0 references
    0 references
    0 references
    18 May 2011
    0 references
    connected dominating set
    0 references
    kernelization
    0 references
    planar graphs
    0 references
    reduce or refine
    0 references

    Identifiers