Deconstructing Intractability: A Case Study for Interval Constrained Coloring

DOI10.1007/978-3-642-02441-2_19zbMath1247.68196MaRDI QIDQ3637114

Rolf Niedermeier, Christian Komusiewicz, Johannes Uhlmann

Publication date: 7 July 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-642-02441-2_19

Mathematics Subject Classification ID

68W05: Nonnumerical algorithms

68R05: Combinatorics in computer science

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)