The Alcuin Number of a Graph

  • Péter Csorba
  • Cor A. J. Hurkens
  • Gerhard J. Woeginger
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5193)

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 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Péter Csorba
    • 1
  • Cor A. J. Hurkens
    • 1
  • Gerhard J. Woeginger
    • 1
  1. 1.Department of Mathematics and Computer ScienceTU EindhovenEindhovenThe Netherlands

Personalised recommendations