1 paper
Yury Demidovich, Yaroslav Panichkin, Maksim Zhukovskii
A k-deck of a (coloured) graph is a multiset of its induced k-vertex subgraphs. Given a graph G, when is it possible to reconstruct with high probability a uniformly random c…