Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Nosaka, Reiya"'
Autor:
Miyata, Hiroyuki, Nosaka, Reiya
A (Euclidean) greedy drawing of a graph is a drawing in which, for any two vertices $s,t$ ($s \neq t$), there is a neighbor vertex of $s$ that is closer to $t$ than to $s$ in the Euclidean distance. Greedy drawings are important in the context of mes
Externí odkaz:
http://arxiv.org/abs/2203.04664
