https://scholars.lib.ntu.edu.tw/handle/123456789/30210
標題: | Enumerating Consecutive and Nested Partitions for Graphs | 作者: | Hwang, F.K. Chang, G.J. |
公開日期: | 1998 | 起(迄)頁: | 63-70 | 來源出版物: | Europ. J. Combinatorics 19 | 摘要: | Consecutive & nested partitions have been extensively studied in the set-partition problem as tools with which to search efficiently for an optimal partition. We extend the study of consecutive and nested partitions on a set of integers to the vertex-set of a graph. A subset of vertices is considered consecutive if the subgraph induced by the subset is connected. In this sense the partition problem on a set of integers can be treated as a special case when the graph is a line. In this paper we give the number of consecutive & nested partitions when the graph is a cycle. We also give a partial order on general graphs with respect to these numbers. |
URI: | http://ntur.lib.ntu.edu.tw//handle/246246/20060927121114414875 | 其他識別: | 20060927121114414875 |
顯示於: | 數學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。