Bandwidth, Edge-Bandwidth and Cyclic Bandwidth of Graphs
碩士 === 國立嘉義大學 === 資訊工程研究所 === 91 === The bandwidth of a graph is the minimum of the maximum difference between labels of adjacent vertices in the graph. Bandwidth of graphs is an useful parameter for many applications including solving linear equations, parallel computation network, VLSI...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2003
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/76391183333994107161 |