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.

• Type: Conference
• Year: 2008
• Where: ESA
• Authors: Péter Csorba, Cor A. J. Hurkens, Gerhard J. Woeginger
• Keywords: Algorithms, Arbitrary Conflict Graphs, ESA 2008, Planning Problem, River Crossing Problem