Skip to main content
Conference Proceedings

The Alcuin number of a graph

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 5193 LNCS 320-331
DOI: 10.1007/978-3-540-87744-8_27
5Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

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. © 2008 Springer-Verlag Berlin Heidelberg.

Author supplied keywords

Cite

CITATION STYLE

APA

Csorba, P., Hurkens, C. A. J., & Woeginger, G. J. (2008). The Alcuin number of a graph. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5193 LNCS, pp. 320–331). Springer Verlag. https://doi.org/10.1007/978-3-540-87744-8_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free