Complexity of the exact domatic number problem and of the exact conveyor flow shop problem

DOI10.1007/s00224-004-1209-8zbMath1100.68085OpenAlexW3175530829MaRDI QIDQ2509032

Jörg Rothe, Tobias Riege

Publication date: 16 October 2006

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.93.8850

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Combinatorics on words (68R15) Graph theory (including graph drawing) in computer science (68R10)

Related Items (7)

An improved exact algorithm for the domatic number problem ⋮ Parameterized complexity of max-lifetime target coverage in wireless sensor networks ⋮ Finding domatic partitions in infinite graphs ⋮ Manipulation in communication structures of graph-restricted weighted voting games ⋮ Domatic partitions of computable graphs ⋮ Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP ⋮ Exact complexity of exact-four-colorability

This page was built for publication: Complexity of the exact domatic number problem and of the exact conveyor flow shop problem