Hardness of k-Vertex-Connected Subgraph Augmentation Problem | |
Ma, Changcun; Kim, Donghyun; Wang, Yuexuan; Wang, Wei; Sohaee, Nassim; Wu, Weili | |
刊名 | JOURNAL OF COMBINATORIAL OPTIMIZATION
![]() |
2010 | |
卷号 | 20期号:3页码:249-258 |
关键词 | Graph connectivity Network survivability |
ISSN号 | 1382-6905 |
DOI | 10.1007/s10878-008-9206-5 |
URL标识 | 查看原文 |
WOS记录号 | WOS:000282050100003 |
内容类型 | 期刊论文 |
URI标识 | http://www.corc.org.cn/handle/1471x/4813632 |
专题 | 西安交通大学 |
推荐引用方式 GB/T 7714 | Ma, Changcun,Kim, Donghyun,Wang, Yuexuan,et al. Hardness of k-Vertex-Connected Subgraph Augmentation Problem[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION,2010,20(3):249-258. |
APA | Ma, Changcun,Kim, Donghyun,Wang, Yuexuan,Wang, Wei,Sohaee, Nassim,&Wu, Weili.(2010).Hardness of k-Vertex-Connected Subgraph Augmentation Problem.JOURNAL OF COMBINATORIAL OPTIMIZATION,20(3),249-258. |
MLA | Ma, Changcun,et al."Hardness of k-Vertex-Connected Subgraph Augmentation Problem".JOURNAL OF COMBINATORIAL OPTIMIZATION 20.3(2010):249-258. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论