Consider a digraph where the vertices represent people and an arc (i,j) represents the possibility of i giving a gift to j. The basic question we pose is whether there is an anonymity-preserving "gift assignment" such that each person makes and receives exactly one gift, and such that no person i can infer the remaining gift assignments from the fact that i is assigned to give a gift to j. We formalize this problem as a graph property involving vertex disjoint circuit covers, give a polynomial algorithm to decide this property for any given graph and provide a computational validation of the algorithm. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Liberti, L., & Raimondi, F. (2008). The secret santa problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5034 LNCS, pp. 271–279). Springer Verlag. https://doi.org/10.1007/978-3-540-68880-8_26
Mendeley helps you to discover research relevant for your work.