位置：成果数据库 > 会议 > 会议详情页
PTAS for Minimum k-Path Connected Vertex Cover in Growth-Bounded Graphs
  • 所属机构名称：苏州大学
  • 会议名称：ICA3PP 2014
  • 时间：2014.8.24
  • 成果类型：会议
  • 相关项目：条件BC网络上独立生成树及其性质的研究
同会议论文项目
条件BC网络上独立生成树及其性质的研究
期刊论文 30 会议论文 22
同项目会议论文
Dynamic reconfiguration of complete binary trees in faulty locally twisted cubes
Embedding complete binary trees into locally twisted cubes
Conditional Connectivity with Distance Requirement on Hypercube
超立方体上条件子结构的连通度
One-to-many disjoint path covers in DCell networks
A node-to-set disjoint path routing algorithm in DCell networks
A VoD system model based on BC graphs
Many-to-many disjoint path covers in DCell
A reliable broadcasting algorithm in locally twisted cubes
Adaptive diagnosis in the locally twisted cube
Relay Hop Constrained Rendezvous Algorithm for Mobile Data Gathering in Wireless Sensor Networks
A model based on crossed cubes for VoD services
Embedding two edge-disjoint Hamiltonian cycles into parity cubes
One-to-one disjoint path covers in DCell
Parallel construction of binomial-like independent spanning trees on twisted cubes
Towards the independent spanning trees in conditional BC networks
Independent spanning trees on special BC networks
Clustering-based data gathering in Wireless Sensor Network with mobile collector
A Hamilton path embedding algorithm on DCell
Circular dimensional-permutations and reliable broadcasting for hypercubes and Möbius cubes
Grid-Based Real-Time Data Gathering Protocol in Wireless Sensor Network with Mobile Sink