Colored cut games (Q2087453): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Logic for Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: New algorithms for the minimum coloring cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum \(k\)-path vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5092393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2965980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / 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: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection Theorems for Systems of Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Problem Which Is Complete in Polynomial Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parameterized complexity of some minimum label problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Flow Through a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preventing small \(\mathbf{(s,t)} \)-cuts by protecting edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-depth, subgraph coloring and homomorphism bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of some two-person perfect-information games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-colored graphs with applications to homogeneous faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: The label cut problem with respect to path length and label frequency / rank
 
Normal rank

Latest revision as of 13:09, 30 July 2024

scientific article
Language Label Description Also known as
English
Colored cut games
scientific article

    Statements

    Colored cut games (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 October 2022
    0 references
    labeled cut
    0 references
    labeled path
    0 references
    network robustness
    0 references
    kernelization
    0 references
    PSPACE
    0 references
    polynomial hierarchy
    0 references

    Identifiers