欢迎您!
东篱公司
退出
申报数据库
申报指南
立项数据库
成果数据库
期刊论文
会议论文
著 作
专 利
项目获奖数据库
位置:
成果数据库
>
会议
> 会议详情页
Linear Problem Kernels for Planar Graph Problems with Small Distance Property
所属机构名称:中南大学
会议名称:36th International Symposium on Mathematical Foundations of Computer Science, MFCS 2011
时间:2011.8.8
成果类型:会议
相关项目:难解问题的核心化技术及其应用研究
作者:
Jianxin Wang|Yongjie Yang|Jiong Guo|Jianer Chen|
同会议论文项目
难解问题的核心化技术及其应用研究
期刊论文 35
会议论文 19
获奖 1
专利 1
著作 2
同项目会议论文
Sparse Kernel Logistic Regression for Beta-turns Prediction
Prediction of essential proteins by integration of PPI network topology and protein complexes inform
Construction of Uncertain Protein-Protein Interaction Networks and Its Applications.
Predicting protein complexes via the integration of multiple biological information
Identifying essential proteins based on protein domains in protein-protein interaction networks
A Clustering Algorithm for Identifying Hierarchical and Overlapping Protein Complexes in Large PPI N
Identifying essential proteins via integration of protein interaction and gene expression data
Identifying Protein Complexes Based on Local Fitness
Active protein interaction network and its application on protein complex detection
A new method for identifying essential proteins based on edge clustering coefficient
A New Measurement for Evaluating Clusters in Protein Interaction Networks
Matching and P 2-Packing: Weighted Versions
A dividing-and-matching algorithm to detect conserved protein complexes via local network alignment
Cograph editing: Complexity and parameterized algorithms
Identification of breast cancer gene signature in protein interaction network using graph centrality
The min-power multicast problems in wireless ad hoc networks: A parameterized view
An improved kernel for planar connected dominating set
Identifying dynamic protein complexes based on gene expression profile and PPI Networks