Algorithms on Circular-arc Graphs and Multiple Stacks

• Main Authors: Hung, Ruo-Wei, 洪若偉
• Other Authors: Chang, Maw-Shang
• Format: Others
• Language: en_US
• Published: 1992
• Online Access: http://ndltd.ncl.edu.tw/handle/55297478991501787651

碩士 === 國立中正大學 === 資訊工程研究所 === 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 Circular-Arc Graphs. 　　In this part, we shall present an algorithm to solve the minimum-cardinality connected domination problem on circular-arc graphs. Given the ar model with endpoints sorted, the algorithm takes only O(n) time and O(n) space where n is the number of arcs (vertices). 　　PART II: An Efficient Algorithm Using Linked Blocks for Multiple Stacks Manipulation. 　　A new and efficient algorithm for multiple stacks manipulation is proposed in this part. Initially, our algorithm assigns the storage to blocks of almost equal size and starts out with all empty stacks and a linked free-blocked list which is a linked list constructed by the blocks. After performing the initialization step, the basic operations of each stack such as PUSH and POP can be done efficiently. According to our simulation results, it is not hard to see that our algorithm is more efficient than the best previous algorithms [Yang et al. 1991; Chang et al. 1991].