The Alcuin Number of a Graph and Its Connections to the Vertex Cover Number
SIAM Journal on Discrete Mathematics
| Hi-index | 0.00 |
The talk discusses planning problems where a set of items has to be transported from location A to location B subject to certain collision and/or resource constraints. We analyze the behavior of these problems, discuss their history, and derive some of their combinatorial and algorithmic properties.