Refined parameterizations for computing colored cuts in edge-colored graphs
type: Item
instance of: scholarly article
title: Refined parameterizations for computing colored cuts in edge-colored graphs
author: Nils Morawietz
author: Niels Grüttemeier
author: Christian Komusiewicz
author: Frank Sommer
published in: Theory of Computing Systems
publication date: 2022-10-04T00:00:00Z
Mathematics Subject Classification ID: 68Q27
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 7596191
zbMATH Keywords: network robustness
zbMATH Keywords: labeled cut
zbMATH Keywords: fixed-parameter tractability
zbMATH Keywords: kernelization
MaRDI profile type: Publication
full work available at URL: s00224-022-10101-z
OpenAlex ID: W4296900537
cites work: Optimal Listing of Cycles and st-Paths in Undirected Graphs
cites work: New algorithms for the minimum coloring cut problem
cites work: Q2965980
cites work: On Problems as Hard as CNF-SAT
cites work: Parameterized Algorithms
cites work: Kernelization Lower Bounds Through Colors and IDs
cites work: Fundamentals of parameterized complexity
cites work: The parameterized complexity of some minimum label problems
cites work: Parametrized complexity theory.
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Which problems have strongly exponential complexity?
cites work: The disjoint paths problem in quadratic time
cites work: Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs
cites work: Q5710169
cites work: Q4663414
cites work: Approximating the minimal sensor selection for supervisory control
cites work: Edge-colored graphs with applications to homogeneous faults
cites work: Approximation and hardness results for label cut and related problems
cites work: The label cut problem with respect to path length and label frequency
DOI: 10.1007/S00224-022-10101-Z
description: scientific article; zbMATH DE number 7596191