Algorithms on Circular-arc Graphs and Multiple Stacks
碩士 === 國立中正大學 === 資訊工程研究所 === 80 === In this thesis, we shall present two efficient algorithms on circular-arc graphs and multiple stacks manipulation, respectively. It is divided into two parts as follows: PART I: An O(n) Time Algorithm for the Minimum Connected Dominating Set Problem on Circu...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
1992
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/55297478991501787651 |