欢迎您!
东篱公司
退出
申报数据库
申报指南
立项数据库
成果数据库
期刊论文
会议论文
著 作
专 利
项目获奖数据库
位置:
成果数据库
>
期刊
> 期刊详情页
Improved Parameterized Algorithms for Minimum Link-Length Rectilinear Spanning Path Problem
ISSN号:0304-3975
期刊名称:Theoretical Computer Science
时间:2014.6.20
页码:158-171
相关项目:精确计算和参数计算的算法新技术
作者:
Jianxin Wang|Chao Xu|Jinyi Yao|Jianer Chen|
同期刊论文项目
精确计算和参数计算的算法新技术
期刊论文 21
会议论文 14
同项目期刊论文
On the Parameterized Vertex Cover Problemfor Graphs with Perfect Matching
Parameterized Algorithms for Maximum Agreement Forest on Multiple Trees
Distances Between Phylogenetic Trees: A Survey
完全p-支配集的参数算法
Algorithms for Parameterized Maximum Agreement Forest Problem on Multiple Trees
On the Minimum Link-Length Rectilinear Spanning Path Problem: Complexity and Algorithms
An Effective Branching Strategy Based on Structural Relationship among Multiple Forbidden Induced Su
Robust and Global Delay-dependent Stability for Genetic Regulatory Networks with Parameter Uncertain
加权3-Set Packing问题的核心化
Kernelization in Parameterized Computation: A survey
An Overview of Kernelization Algorithms for Graph Modification Problems