A Study of Minimum Vertex Ranking Spanning Tree Problem on Some Classes of Graphs
碩士 === 國立東華大學 === 資訊工程學系 === 96 === A vertex ranking of a graph G is a labeling of the vertices of G with positive integers such that every path between two vertices with the same label i contains a vertex with label j > i. A vertex ranking is minimum if the largest rank k in it is the smallest a...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/5hbbp9 |