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"”.
-
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 …
-
Discrepancy Inequalities in Graphs and Their Applications
… pebble placed on each vertex of <em>G</em>. The routing number, <em>rt(G)</em>, of <em>G</em> is the minimum number of steps needed to route any permutation on the vertices of <em>G</em>, where a step consists of selecting a matching in the graph and swapping the pebbles on the endpoints of each …