位置：成果数据库 > 期刊 > 期刊详情页
Hardness of k-Vertex-Connected Subgraph Augmentation Problem
  • ISSN号：1382-6905
  • 期刊名称：Journal of Combinatorial Optimization
  • 时间：2010.10.10
  • 页码：249-258
  • 相关项目：结合压缩采样与网络编码的无线传感器网络负载均衡与节能关键技术研究
作者： Ma, Changcun|Kim, Donghyun|Wang, Yuexuan|Wang, Wei|Sohaee, Nassim|Wu, Weili|
同期刊论文项目
结合压缩采样与网络编码的无线传感器网络负载均衡与节能关键技术研究
期刊论文 21 会议论文 17
同项目期刊论文
A reliable scheduling method in equipment grid using provenance information
Predict the Multi-hop Reliability for Receiver-Contention Based Routing in Dynamic Link Networks
New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating se
Fault-tolerant routing: -inconnected many-to-one routing in wireless networks
Comment on "State-Independent Experimental Test of Quantum Contextuality in an Indivisible Syst
Satisfiability with Index Dependency
New Approximations for Minimum-Weighted Dominating Set and Minimum-Weighted Connected Dominating Set
Experimental demonstration of quantum gain in a zero-sum game
An Approximate Approach for Area Coverage in Wireless Sensor Networks
Dynamic Programming Based Algorithms for Set Multicover and Multiset Multicover Problems
基于电光效应的光子频移研究
2012年诺贝尔物理学奖：大卫·维因兰德