Towards optimal kernel for edge-disjoint triangle packing (Q2446590): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ipl.2014.02.003 / 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.ipl.2014.02.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2017799420 / 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: Cluster editing: kernelization based on edge cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing triangles in bounded degree graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving large FPT problems on coarse-grained parallel machines / 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: Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear vertex kernel for maximum internal spanning tree / 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 NP-Completeness of Some Edge-Partition Problems / 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: Kernelization – Preprocessing with a Guarantee / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized and Exact Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graph vertex partition for linear problem kernels / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IPL.2014.02.003 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:39, 18 December 2024

scientific article
Language Label Description Also known as
English
Towards optimal kernel for edge-disjoint triangle packing
scientific article

    Statements

    Towards optimal kernel for edge-disjoint triangle packing (English)
    0 references
    0 references
    17 April 2014
    0 references
    triangle packing
    0 references
    kernelization
    0 references
    linear kernel
    0 references
    fixed-parameter tractable
    0 references
    graph algorithms
    0 references

    Identifiers

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