| On a Problem of Judicious k-Partitions of Graphs | |
| Hou, Jianfeng; Zeng, Qinghou | |
| 刊名 | JOURNAL OF GRAPH THEORY
 |
| 2017 | |
| 卷号 | 85页码:619-643 |
| 关键词 | graph max-cut judicious partition |
| ISSN号 | 0364-9024 |
| URL标识 | 查看原文 |
| 内容类型 | 期刊论文 |
| URI标识 | http://www.corc.org.cn/handle/1471x/2891594 |
| 专题 | 福州大学 |
| 推荐引用方式 GB/T 7714 | Hou, Jianfeng,Zeng, Qinghou. On a Problem of Judicious k-Partitions of Graphs[J]. JOURNAL OF GRAPH THEORY,2017,85:619-643. |
| APA | Hou, Jianfeng,&Zeng, Qinghou.(2017).On a Problem of Judicious k-Partitions of Graphs.JOURNAL OF GRAPH THEORY,85,619-643. |
| MLA | Hou, Jianfeng,et al."On a Problem of Judicious k-Partitions of Graphs".JOURNAL OF GRAPH THEORY 85(2017):619-643. |
| 个性服务 |
| 查看访问统计 |
| 相关权益政策 |
| 暂无数据 |
| 收藏/分享 |
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论