Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring
From MaRDI portal
Publication:533417
DOI10.1016/j.jda.2010.07.003zbMath1228.05154MaRDI QIDQ533417
Rolf Niedermeier, Christian Komusiewicz, Johannes Uhlmann
Publication date: 3 May 2011
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2010.07.003
experiments; NP-hard problem; parametrized complexity; interval constraint coloring; multivariate algorithmics