The p-maxian Problem in Permutation Graphs
碩士 === 國立臺灣科技大學 === 資訊管理系 === 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 clas...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2014
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/24529072013185499062 |