Abstract
A graph drawing is greedy if, for every ordered pair of vertices (x, y), there is a path from x to y such that the Euclidean distance to y decreases m......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
