On the Minimum Ranking Spanning Tree Problem
博士 === 國立東華大學 === 資訊工程學系 === 103 === An edge (respectively, vertex) ranking of a graph G is a labeling of edges (respectively, vertex) of G with positive integers such that every path in $G$ between any two edges (respectively, vertices) of the same label i contains at least one edge (respectively,...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Published: |
2014
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/10126879535203296845 |