Colored cut games
From MaRDI portal
Publication:2087453
DOI10.1016/j.tcs.2022.09.013OpenAlexW4296333441MaRDI QIDQ2087453
Christian Komusiewicz, Niels Grüttemeier, Frank Sommer, Nils Morawietz
Publication date: 21 October 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.09.013
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The label cut problem with respect to path length and label frequency
- Fundamentals of parameterized complexity
- Matching interdiction
- On the complexity of some two-person perfect-information games
- Edge-colored graphs with applications to homogeneous faults
- The parameterized complexity of some minimum label problems
- Minimum \(k\)-path vertex cover
- Parametrized complexity theory.
- Tree-depth, subgraph coloring and homomorphism bounds
- Preventing small \(\mathbf{(s,t)} \)-cuts by protecting edges
- Mathematical Logic for Computer Science
- Maximal Flow Through a Network
- Intersection Theorems for Systems of Sets
- Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- A Combinatorial Problem Which Is Complete in Polynomial Space
- Color-coding
- Computational Complexity
- Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses
- Parameterized Algorithms
- New algorithms for the minimum coloring cut problem
This page was built for publication: Colored cut games
