The Secret Santa Problem

DOI10.1007/978-3-540-68880-8_26MaRDI QIDQ3511435zbMATH OpenOpenAlexFDO

Authors Leo Liberti, Franco Raimondi

Publication date 10 July 2008

Published in Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://eprints.mdx.ac.uk/5279/1/sesan-aaim.pdf

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A faster cryptographer's Conspiracy Santa
• A cryptographer's Conspiracy Santa
• Crypto Santa
• The anonymous subgraph problem
• Analysis of the gift exchange problem

Cites work

• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Derangements, Permanents, and Christmas Presents
• scientific article; zbMATH DE number 795590 (Why is no real title available?)
• The dining cryptographers problem: Unconditional sender and recipient untraceability

Cited in

(6)

• Analysis of the gift exchange problem
• Crypto Santa
• The Santa Claus problem
• A cryptographer's Conspiracy Santa
• The anonymous subgraph problem
• The secret Santa problem continues

This page was built for publication: The Secret Santa Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3511435)