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 2 of 2 for “"Routing number"”.

  1. Genome Rearrangement, Randic Index and Routing Number

    … and compute their distances based on the minimum number of certain operations (evolutionary events) needed to transform one permutation into another. Reversal and transposition are two well-studied operations in this area. In 1995, Hannenhalli and Pevzner [20] discovered an elegant formula to …

    south-carolina Repository record for Genome Rearrangement, Randic Index and Routing Number (opens in a new tab)

  2. Discrepancy Inequalities in Graphs and Their Applications

    … G, with a pebble placed on each vertex of G. The routing number, rt(G), of G is the minimum number of steps needed to route any permutation on the vertices of G, where a step consists of selecting a matching in the graph and swapping the pebbles on the endpoints of each edge. Alon, Chung, and …

    denver Repository record for Discrepancy Inequalities in Graphs and Their Applications (opens in a new tab)