Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs

DOI10.1007/978-3-030-38919-2_21zbMath1440.68140OpenAlexW3000485278MaRDI QIDQ3297773

Niels Grüttemeier, Frank Sommer, Nils Morawietz, Christian Komusiewicz

Publication date: 20 July 2020

Published in: SOFSEM 2020: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-38919-2_21

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (2)

Refined parameterizations for computing colored cuts in edge-colored graphs ⋮ Colored cut games

Cites Work

• Unnamed Item
• Unnamed Item
• The label cut problem with respect to path length and label frequency
• Fundamentals of parameterized complexity
• Edge-colored graphs with applications to homogeneous faults
• The parameterized complexity of some minimum label problems
• Parameterized Algorithms
• Maximum cuts in edge-colored graphs

This page was built for publication: Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs