Unique reconstruction threshold for random jigsaw puzzles

DOI10.4086/cjtcs.2017.002zbMath1375.05176arXiv1605.03043OpenAlexW4239861662MaRDI QIDQ5360828

Pascal Pfister, Rajko Nenadov, Angelika Steger

Publication date: 26 September 2017

Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.03043

zbMATH Keywords

graph reconstructionjigsaw puzzle

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (3)

Shotgun reconstruction in the hypercube ⋮ A Linear Threshold for Uniqueness of Solutions to Random Jigsaw Puzzles ⋮ Shotgun assembly of Erdős-Rényi random graphs

This page was built for publication: Unique reconstruction threshold for random jigsaw puzzles