The Strong Distance Problem on Some Digraph
碩士 === 國立暨南國際大學 === 資訊工程學系 === 91 === Suppose G = (V, E) is a graph and D = (V, F) is a strong orientation of G. A digraph D is strong if for every pair u, v of distinct vertices of V, there are both directed u - v path and a directed v-u path in D. Let u, v Î V(D), the strong distance sd...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2003
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/17155359145163945917 |