Search Results - Nonnumerical Algorithms and Problems— Routing and Layout

  • Showing 1 - 2 results of 2
Refine Results
  1. 1
    Cover Image

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

    ISSN: 2165-8773
    Published: IEEE 01.04.2018
    Published in 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…”
    Get full text
    Conference Proceeding
    Save to List
    Saved in:
  2. 2
    Cover Image

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

    ISSN: 1045-9219, 1558-2183
    Published: New York IEEE 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…”
    Get full text
    Journal Article
    Save to List
    Saved in:

Search Tools: