A study of the routing number of paths and path plus an edge
碩士 === 淡江大學 === 數學學系碩士班 === 103 === The problem of routing permutations over graphs arose in different fields , such as the study of communicating processes on networks, the data flow on parallel computation, and the analysis of routing algorithms on VLSI chips. This problem can be described as foll...
Main Authors: | Kai-Wen Yu, 虞凱文 |
---|---|
Other Authors: | 潘志實 |
Format: | Others |
Language: | zh-TW |
Published: |
2015
|
Online Access: | http://ndltd.ncl.edu.tw/handle/54931386763828246653 |
Similar Items
-
Characterize the routing number of paths
by: Ming-Jhan Han, et al.
Published: (2016) -
Counting the number of minimal paths in weighted coloured-edge graphs
by: Ensor, A, et al.
Published: (2011) -
From Paths to Routes: A Method for Path Classification
by: Andrea Gonsek, et al.
Published: (2021-01-01) -
On effects and applications of IM , Edge –path and Edge -path Order for reducing crossing -edges in proper hierarchical graphics
by: ke yun ping, et al.
Published: (2007) -
Tight upper bound on the number of optimal paths in weighted coloured-edge graphs
by: Ensor, A, et al.
Published: (2011)