Parallel Algorithms for the All-pairs Tree Bisector Problem and its Applications
碩士 === 國立清華大學 === 資訊工程學系 === 88 === An edge is a bisector of a simple path if it contains the middle point of the path. Let T=(V, E) be a tree. The all-pairs tree bisector problem is to find for every pair of vertices u, v in V a bisector of the simple path from u to v. In this thesis, the all-pairs...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2000
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/23101878202975921428 |