Efficient Parallel Algorithms for the r-Dominating Set and p-Center Problems on Trees
碩士 === 國立清華大學 === 資訊工程學系 === 90 === Let T=(V, E) be a free tree with vertex set V and edge set E. Let n=|V|. Each eE has a non-negative length. In this thesis, we first present an algorithm on the CREW PRAM for solving the V/V/r-dominating set problem on T, where r0 is a real number. The presented...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2002
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/73102482564634425326 |