CORC  > 山东大学
A new approximation algorithm for the unbalanced Min s-t Cut problem
Zhang, Peng
刊名THEORETICAL COMPUTER SCIENCE
2016
卷号609页码:658-665
关键词Unbalanced cut MM s-t cut Approximation algorithm Linear programming Network community
DOI10.1016/j.tcs.2015.02.040
会议名称20th International Conference on Computing and Combinatorics (COCOON)
URL标识查看原文
会议日期AUG 04-06, 2014
内容类型期刊论文
URI标识http://www.corc.org.cn/handle/1471x/4760374
专题山东大学
作者单位Shandong Univ, Sch Comp Sci & Technol, Jinan, Peoples R China.
推荐引用方式
GB/T 7714
Zhang, Peng. A new approximation algorithm for the unbalanced Min s-t Cut problem[J]. THEORETICAL COMPUTER SCIENCE,2016,609:658-665.
APA Zhang, Peng.(2016).A new approximation algorithm for the unbalanced Min s-t Cut problem.THEORETICAL COMPUTER SCIENCE,609,658-665.
MLA Zhang, Peng."A new approximation algorithm for the unbalanced Min s-t Cut problem".THEORETICAL COMPUTER SCIENCE 609(2016):658-665.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace