The p-maxian Problem in Permutation Graphs

• Main Authors: Chun-Hsiang Chang, 張鈞翔
• Other Authors: Yue-Li Wang
• Format: Others
• Language: en_US
• Published: 2014
• Online Access: http://ndltd.ncl.edu.tw/handle/24529072013185499062

碩士 === 國立臺灣科技大學 === 資訊管理系 === 102 === In this thesis, we are concerned with the p-maxian problem in permutation graphs. At first, we propose the concept of k-stable for general graphs. We partition all permutation graphs into nine classes, and prove that it is 4-stable for permutation graphs in class 1, 3-stable in classes 2, 4 and 2-stable in class 5. Finally, we propose algorithms for solving the p-maxian problem in permutation graphs in class 1, permutation graphs in classes 2 and 4 and permutation graphs in class 5 in $O(n^4)$, $O(n^3)$ and $O(n^2)$ time, respectively.