| Partitioning dense uniform hypergraphs | |
| Wu, Shufei; Hou, Jianfeng | |
| 刊名 | JOURNAL OF COMBINATORIAL OPTIMIZATION
 |
| 2018 | |
| 卷号 | 35页码:48-63 |
| 关键词 | Max-Cut Partition Hypergraph Azuma-Hoeffding inequality |
| ISSN号 | 1382-6905 |
| URL标识 | 查看原文 |
| 内容类型 | 期刊论文 |
| URI标识 | http://www.corc.org.cn/handle/1471x/2888265 |
| 专题 | 福州大学 |
| 推荐引用方式 GB/T 7714 | Wu, Shufei,Hou, Jianfeng. Partitioning dense uniform hypergraphs[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION,2018,35:48-63. |
| APA | Wu, Shufei,&Hou, Jianfeng.(2018).Partitioning dense uniform hypergraphs.JOURNAL OF COMBINATORIAL OPTIMIZATION,35,48-63. |
| MLA | Wu, Shufei,et al."Partitioning dense uniform hypergraphs".JOURNAL OF COMBINATORIAL OPTIMIZATION 35(2018):48-63. |
| 个性服务 |
| 查看访问统计 |
| 相关权益政策 |
| 暂无数据 |
| 收藏/分享 |
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论