Zobrazeno 1 - 1
of 1
pro vyhledávání: '"05C85 (Primary) 68R05, 90C05, 90C59 (Secondary)"'
Given a graph $G$, the optimization version of the graph burning problem seeks for a sequence of vertices, $(u_1,u_2,...,u_p) \in V(G)^p$, with minimum $p$ and such that every $v \in V(G)$ has distance at most $p-i$ to some vertex $u_i$. The length $
Externí odkaz:
http://arxiv.org/abs/2401.07577