Unbalanced Graph Partitioning | |
Angsheng Li; Peng Zhang | |
刊名 | Theory of computing systems |
2013 | |
卷号 | 53期号:3页码:454-466 |
关键词 | Unbalanced cut Sparsest cut Network community Social networks Approximation algorithms |
DOI | 10.1007/s00224-012-9436-x |
URL标识 | 查看原文 |
内容类型 | 期刊论文 |
URI标识 | http://www.corc.org.cn/handle/1471x/5170145 |
专题 | 山东大学 |
作者单位 | 1.State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, 100190, China 2.School of Com |
推荐引用方式 GB/T 7714 | Angsheng Li,Peng Zhang. Unbalanced Graph Partitioning[J]. Theory of computing systems,2013,53(3):454-466. |
APA | Angsheng Li,&Peng Zhang.(2013).Unbalanced Graph Partitioning.Theory of computing systems,53(3),454-466. |
MLA | Angsheng Li,et al."Unbalanced Graph Partitioning".Theory of computing systems 53.3(2013):454-466. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论