Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"Heavy-Path"”.

  1. Routing on Heavy Path WSPD Spanners

    … on a set of $n$ points in $\R^d$ that we call a heavy path WSPD spanner. The construction is parameterized by a constant $s>2$. The size of the graph is $O(s^dn)$ and the spanning ratio is at most $1+2/s+2/(s-1)$. We also show that this graph has a hop spanning ratio of at most $2\lg{n}+1$. We …

    carleton Repository record for Routing on Heavy Path WSPD Spanners (opens in a new tab)

  2. Optimal Path-Decomposition of Tries

    In this thesis, we consider the path-decomposition representation of prefix trees. We show that given query probabilities for every word in the prefix tree, the heavy-path strategy produces the optimal trie with respect to the number of node accesses. We show how to implement the heavy-path …

    waterloo Repository record for Optimal Path-Decomposition of Tries (opens in a new tab)

  3. On Structures of Large Rooted Graphs

    … of Robertson and Seymour, let’s only talk about path and star. In the first result they established that graphs without a long path subgraph are precisely those that can be constructed using a specific operation within a bounded number of iterations, starting from the trivial graph. In the second …

    lsu-thes Repository record for On Structures of Large Rooted Graphs (opens in a new tab)