A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2023; you can also visit the original URL.
The file type is application/pdf
.
Complete combinatorial characterization of greedy-drawable trees
[article]
2023
arXiv
pre-print
A (Euclidean) greedy drawing of a graph is a drawing in which, for any two vertices s,t (s ≠ 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 message routing in networks, and graph classes that admit greedy drawings have been actively studied. Nöllenburg and Prutkin (Discrete Comput. Geom., 58(3), pp.543-579, 2017) gave a characterization of greedy-drawable trees in terms of an inequality system that
arXiv:2203.04664v2
fatcat:ybavwrkwtvaojdrevxntnptz54