Parameterized algorithms for load coloring problem (Q2448120): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the minimum load coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On problems without polynomial kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3113681 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernel Bounds for Disjoint Cycles and Disjoint Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank

Latest revision as of 10:51, 8 July 2024

scientific article
Language Label Description Also known as
English
Parameterized algorithms for load coloring problem
scientific article

    Statements

    Parameterized algorithms for load coloring problem (English)
    0 references
    0 references
    30 April 2014
    0 references
    design of algorithms
    0 references
    fixed-parameter tractable
    0 references
    kernel
    0 references
    load coloring
    0 references

    Identifiers

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