| Bounds for the number of meeting edges in graph partitioning | |
| Zeng, Qinghou; Hou, Jianfeng | |
| 刊名 | CZECHOSLOVAK MATHEMATICAL JOURNAL
 |
| 2017 | |
| 卷号 | 67页码:741-752 |
| 关键词 | judicious partition graph partition weighted hypergraph |
| ISSN号 | 0011-4642 |
| URL标识 | 查看原文 |
| 内容类型 | 期刊论文 |
| URI标识 | http://www.corc.org.cn/handle/1471x/2891616 |
| 专题 | 福州大学 |
| 推荐引用方式 GB/T 7714 | Zeng, Qinghou,Hou, Jianfeng. Bounds for the number of meeting edges in graph partitioning[J]. CZECHOSLOVAK MATHEMATICAL JOURNAL,2017,67:741-752. |
| APA | Zeng, Qinghou,&Hou, Jianfeng.(2017).Bounds for the number of meeting edges in graph partitioning.CZECHOSLOVAK MATHEMATICAL JOURNAL,67,741-752. |
| MLA | Zeng, Qinghou,et al."Bounds for the number of meeting edges in graph partitioning".CZECHOSLOVAK MATHEMATICAL JOURNAL 67(2017):741-752. |
| 个性服务 |
| 查看访问统计 |
| 相关权益政策 |
| 暂无数据 |
| 收藏/分享 |
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论