Suchergebnisse - Nonnumerical Algorithms AND Problems— Routing AND Layout~

Optimal Algorithms for Compact Linear Layouts von Sonke, Willem, Verbeek, Kevin, Meulemans, Wouter, Verbeek, Eric, Speckmann, Bettina

“… In this paper we present a novel and versatile algorithm to optimally fold a linear layout of a graph such that it …”
Volltext

Trade-Offs between Stretch Factor and Load-Balancing Ratio in Routing on Growth-Restricted Graphs von Gao, Jie, Zhang, Li

“… We show that if the routing algorithm is required to use paths with stretch factor c, then its load-balancing ratio is bounded by O(rho 1/k (n/c) 1-1/k …”
Volltext