Publication: Enumerating Consecutive and Nested Partitions for Graphs
| dc.contributor | 國立臺灣大學數學系 | zh_TW |
| dc.contributor.author | Hwang, F.K. | en |
| dc.contributor.author | Chang, G.J. | en |
| dc.creator | Hwang, F.K.; Chang, G.J. | en |
| dc.date | 1998 | zh_TW |
| dc.date.accessioned | 2006-09-27T08:59:45Z | |
| dc.date.accessioned | 2018-06-28T09:11:28Z | |
| dc.date.available | 2006-09-27T08:59:45Z | |
| dc.date.available | 2018-06-28T09:11:28Z | |
| dc.date.issued | 1998 | |
| dc.description.abstract | 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. | en |
| dc.format | application/pdf | en |
| dc.format.extent | 118553 bytes | en |
| dc.format.mimetype | application/pdf | en |
| dc.identifier | 20060927121114414875 | zh_TW |
| dc.identifier.uri | http://ntur.lib.ntu.edu.tw//handle/246246/20060927121114414875 | |
| dc.identifier.uri.fulltext | http://ntur.lib.ntu.edu.tw/bitstream/246246/20060927121114414875/1/045.pdf | |
| dc.language | zh-TW | zh_TW |
| dc.language.iso | zh_TW | zh_TW |
| dc.relation | Europ. J. Combinatorics 19,63-70 | en |
| dc.relation.ispartof | Europ. J. Combinatorics 19 | |
| dc.relation.pages | 63-70 | |
| dc.source | http://www.math.ntu.edu.tw/~gjchang/publication/45.pdf | en |
| dc.title | Enumerating Consecutive and Nested Partitions for Graphs | en |
| dc.type | journal article | en |
| dspace.entity.type | Publication |
Files
Original bundle
1 - 1 of 1