Characterize the routing number of paths
碩士 === 淡江大學 === 數學學系碩士班 === 104 === Let G=(V,E) be a connected graph with vertices {v_1,v_2,…,v_n} and π be a permutation on [n]. Initially, each vertex v_i of G is occupied by a “pebble”. The pebble on v_i will be labeled as j if π(i)=j. Pebbles can be moved around by the following rule. At each st...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2016
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/57482822845164583089 |