Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Panichkin, Yaroslav"'
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 colouring of its vertices in $r$ colours from its $k$-deck? In this pap
Externí odkaz:
http://arxiv.org/abs/2308.01671
