Výsledky vyhledávání - Nonnumerical Algorithms and Problems— Routing and Layout
-
1
Optimal Algorithms for Compact Linear Layouts
ISSN: 2165-8773Vydáno: IEEE 01.04.2018Vydáno v IEEE Pacific Visualization Symposium (01.04.2018)“… In this paper we present a novel and versatile algorithm to optimally fold a linear layout of a graph such that it…”
Získat plný text
Konferenční příspěvek -
2
Trade-Offs between Stretch Factor and Load-Balancing Ratio in Routing on Growth-Restricted Graphs
ISSN: 1045-9219, 1558-2183Vydáno: New York IEEE 01.02.2009Vydáno v IEEE transactions on parallel and distributed systems (01.02.2009)“… 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…”
Získat plný text
Journal Article