Planar graph vertex partition for linear problem kernels (Q355502): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Jian'er Chen / rank
Normal rank
 
Property / author
 
Property / author: Jian'er Chen / rank
 
Normal rank
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.2012.08.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2011167300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization: New Upper and Lower Bound Techniques / 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: Linear Problem Kernels for NP-Hard Problems on Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parameterized complexity of the induced matching problem / 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: Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Kernel for Planar Connected Dominating Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Kernel for Planar Connected Dominating Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Meta) Kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards optimal kernel for connected vertex cover in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incompressibility through Colors and IDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bidimensionality and Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Parameterized Algorithms for the Edge Dominating Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Problem Kernelization for Graph Packing / rank
 
Normal rank

Latest revision as of 16:43, 6 July 2024

scientific article
Language Label Description Also known as
English
Planar graph vertex partition for linear problem kernels
scientific article

    Statements

    Planar graph vertex partition for linear problem kernels (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 July 2013
    0 references
    parameterized algorithm
    0 references
    kernelization
    0 references
    connected vertex cover
    0 references
    edge dominating set
    0 references
    maximum triangle packing
    0 references

    Identifiers

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