The Alcuin Number of a Graph

Authors:
Péter Csorba;Cor A. Hurkens;Gerhard J. Woeginger
Affiliations:
Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, The Netherlands 5600 MB;Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, The Netherlands 5600 MB;Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, The Netherlands 5600 MB
Venue:
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Year:
2008

Citing 4
Cited 1

A combinatorial algorithm minimizing submodular functions in strongly polynomial time

Journal of Combinatorial Theory Series B
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Vertex cover might be hard to approximate to within 2-ε

Journal of Computer and System Sciences
The ferry cover problem

FUN'07 Proceedings of the 4th international conference on Fun with algorithms

Algorithms and complexity of generalized river crossing problems

FUN'12 Proceedings of the 6th international conference on Fun with Algorithms

Quantified Score

Hi-index	0.00

Visualization

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.