Incremental List Coloring of Graphs, Parameterized by Conservation

DOI10.1007/978-3-642-13562-0_24zbMath1284.68279OpenAlexW2178705251MaRDI QIDQ3569081

Rolf Niedermeier, Sepp Hartung

Publication date: 17 June 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13562-0_24

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

The parameterized complexity of local search for TSP, more refined ⋮ Incremental list coloring of graphs, parameterized by conservation ⋮ Parameterized and subexponential-time complexity of satisfiability problems and applications

This page was built for publication: Incremental List Coloring of Graphs, Parameterized by Conservation