Showing 1 - 9 of 9
Persistent link: https://www.econbiz.de/10005095168
In this paper we present the Selective Graph Coloring Problem, a generalization of the standard graph coloring problem as well as several of its possible applications. Given a graph with a partition of its vertex set into several clusters, we want to select one vertex per cluster such that the...
Persistent link: https://www.econbiz.de/10011097811
Given a graph G and a positive integer K, the inverse chromatic number problem consists in modifying the graph as little as possible so that it admits a chromatic number not greater than K. In this paper, we focus on the inverse chromatic number problem for certain classes of graphs. First, we...
Persistent link: https://www.econbiz.de/10011209329
We study the problem where a robot has to pick up items of different sizes which are stored along a corridor. A natural requirement is that the items have to be collected in decreasing order of their sizes. We deal with various systems according to the location of the Entry/Exit station where...
Persistent link: https://www.econbiz.de/10005347224
Persistent link: https://www.econbiz.de/10005151547
Persistent link: https://www.econbiz.de/10005152264
Persistent link: https://www.econbiz.de/10005253674
Persistent link: https://www.econbiz.de/10005277639
Persistent link: https://www.econbiz.de/10005277800