Partitioning into Colorful Components by Minimum Edge Deletions

DOI10.1007/978-3-642-31265-6_5zbMath1358.68113OpenAlexW2126396654MaRDI QIDQ2904478

Sharon Bruckner, Christian Komusiewicz, Falk Hüffner, Sven Thiel, Johannes Uhlmann, Rolf Niedermeier

Publication date: 14 August 2012

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31265-6_5

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (5)

Parameterized complexity and approximation issues for the colorful components problems ⋮ Colourful components in \(k\)-caterpillars and planar graphs ⋮ Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem ⋮ Algorithmic and hardness results for the colorful components problems ⋮ Finding a Small Number of Colourful Components

This page was built for publication: Partitioning into Colorful Components by Minimum Edge Deletions