The Alcuin Number of a Graph
We consider a planning problem that generalizes Alcuin’s river crossing problem (also known as: The wolf, goat, and cabbage puzzle) to scenarios with arbitrary conflict graphs. We derive a variety of combinatorial, structural, algorithmical, and complexity theoretical results around this problem.
KeywordsTransportation problem scheduling graph theory
Unable to display preview. Download preview PDF.