位置：成果数据库 > 期刊 > 期刊详情页
An O*(3.53(3k))-time parameterized algorithm for the 3-set packing problem
  • ISSN号：0304-3975
  • 期刊名称：Theoretical Computer Science
  • 时间：2011.4.4
  • 页码：1745-1753
  • 相关项目：难解问题的核心化技术及其应用研究
作者： Wang, Jianxin|Feng, Qilong|Chen, Jianer|
同期刊论文项目
难解问题的核心化技术及其应用研究
期刊论文 35 会议论文 19 获奖 1 专利 1 著作 2
同项目期刊论文
Symmetry compression method for discovering network motifs
An effective method for refining predicted protein complexes based on protein activity and the mecha
加权3-Set Packing问题的核心化
De novo assembly methods for next generation sequencing data
hF‐measure: A new measurement for evaluating clusters in protein–protein interaction networks
Identification of hierarchical and overlapping functional modules in PPI networks
Color-Coding and its Applications: A Survey
基于团渗透和距离限制的蛋白质复合物识别算法
Identifying Protein Complexes From Interactome Based on Essential Proteins and Local Fitness Method
improved linear problem kernel for planar connected dominating set
A comparison of the functional modules identified from time course and static PPI network data
虚拟实验环境中协同支撑的设计与实现
WiMAX Mesh网络中基于团划分的中继部署算法
蛋白质复合物预测方法分析与比较
路径节点驱动的低代价最短路径树算法
多核处理器硅后调试技术研究最新进展
Mining Protein Complexes from PPI Networks Using the Minimum Vertex Cut