Chapter

Algorithms - ESA 2008

Volume 5193 of the series Lecture Notes in Computer Science pp 320-331

The Alcuin Number of a Graph

  • Péter CsorbaAffiliated withDepartment of Mathematics and Computer Science, TU Eindhoven
  • , Cor A. J. HurkensAffiliated withDepartment of Mathematics and Computer Science, TU Eindhoven
  • , Gerhard J. WoegingerAffiliated withDepartment of Mathematics and Computer Science, TU Eindhoven

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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.

Keywords

Transportation problem scheduling graph theory