Zobrazeno 1 - 10
of 347
pro vyhledávání: '"Fiala Jiří"'
We study the problem of gradually representing a complex graph as a sequence of drawings of small subgraphs whose union is the complex graph. The sequence of drawings is called \emph{storyplan}, and each drawing in the sequence is called a \emph{fram
Externí odkaz:
http://arxiv.org/abs/2311.13523
The notion of graph covers is a discretization of covering spaces introduced and deeply studied in topology. In discrete mathematics and theoretical computer science, they have attained a lot of attention from both the structural and complexity persp
Externí odkaz:
http://arxiv.org/abs/2306.06431