Edge Ranking Problem on Cartesian Product Graphs
碩士 === 國立暨南國際大學 === 資訊工程學系 === 98 === An edge k-ranking is a function f:E(1, 2, ..., k), where E is the edge set of a graph G and k is a positive integer, such that every path between any two edges with the same color i, should exist at least one edge whose color is greater than i. The edge ranking...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Online Access: | http://ndltd.ncl.edu.tw/handle/42470900229654389669 |