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

Tobias Riege, Jörg Rothe · 2004

The domatic number problem, DNP, arises in the area of computer networks, e.g., in the task of allocating resources in a computer network or in the task of transmitting messages in a communication network. This paper describes the complexity of the exact domatic number problem and of the exact conveyor flow shop problem.

Read the paper · More papers on PaperTik