Computing k-vertex Connectivity and Disjoint s-t Paths on Permutation Graphs
碩士 === 國立臺灣科技大學 === 電機工程研究所 === 82 === In this thesis, we shall present several algorithms for determining the maximum number of vertex connectivity, testing k-vertex connectivity, determining the maximum number of vertex disjoint s-t paths...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
1994
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/99702755546761759037 |