The parameterized complexity of some minimum label problems (Q1959420): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an 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.2010.02.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2095819433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On problems without polynomial kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees with many or few colors in edge-colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4659605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search for the minimum label spanning tree problem with bounded color classes. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum labeling spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of multiple-interval graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity ecology of parameters: An illustration using bounded max leaf number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms and hardness results for labeled connectivity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum label spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The labeled perfect matching in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex recolorings of strings and trees: Definitions, hardness results and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4370201 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the minimum label spanning tree. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Hardness Results for Label Cut and Related Problems / rank
 
Normal rank

Latest revision as of 07:44, 3 July 2024

scientific article
Language Label Description Also known as
English
The parameterized complexity of some minimum label problems
scientific article

    Statements

    The parameterized complexity of some minimum label problems (English)
    0 references
    0 references
    0 references
    0 references
    7 October 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    edge labeled graphs
    0 references
    W-hardness
    0 references
    fixed-parameter tractability
    0 references
    0 references
    0 references