(t, s)-transmitting Problem on Trees and Other Graph
碩士 === 國立東華大學 === 應用數學系 === 89 === Given an interconnection network, if we represent the processors as vertices, and the communication links as edges, then we can construct a graph model for this network. For this graph G=(V, E), assume that there is a vertex v0, outside the graph G, whic...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2001
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/01121186885440445941 |