| 来源类型 | Article |
| 规范类型 | 其他 |
| DOI | 10.1016/0166-218X(92)00036-L |
| Periodic assignment and graph colouring. | |
| Korst J; Aarts EHL; Lenstra JK; Wessels J | |
| 发表日期 | 1994 |
| 出处 | Discrete Applied Mathematics 51 (3): 291-305 |
| 出版年 | 1994 |
| 语种 | 英语 |
| 摘要 | We analyse the problem of executing periodic operations on a minimum number of identical processors under different constraints. The analysis is based on a reformulation of the problem in terms of graph colouring. It is shown that different constraints result in colouring problems defined on different classes of graphs, viz. interval graphs, circular-arc graphs and periodic-interval graphs. We discuss the complexity of these colouring problems in detail. |
| 主题 | Methodology of Decision Analysis (MDA) |
| 关键词 | Periodic assignment Graph colouring Interval graphs Circular-arc graphs Periodic-interval graphs |
| URL | http://pure.iiasa.ac.at/id/eprint/3885/ |
| 来源智库 | International Institute for Applied Systems Analysis (Austria) |
| 引用统计 | |
| 资源类型 | 智库出版物 |
| 条目标识符 | http://119.78.100.153/handle/2XGU8XDN/127275 |
| 推荐引用方式 GB/T 7714 | Korst J,Aarts EHL,Lenstra JK,et al. Periodic assignment and graph colouring.. 1994. |
| 条目包含的文件 | 条目无相关文件。 | |||||
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
