咨询与建议

限定检索结果

文献类型

  • 33 篇 期刊文献
  • 8 篇 会议

馆藏范围

  • 41 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 31 篇 工学
    • 30 篇 计算机科学与技术...
    • 3 篇 电气工程
    • 2 篇 软件工程
  • 23 篇 理学
    • 20 篇 数学
    • 6 篇 生物学
    • 3 篇 统计学(可授理学、...
  • 9 篇 管理学
    • 9 篇 管理科学与工程(可...
    • 1 篇 工商管理
  • 1 篇 经济学
    • 1 篇 应用经济学

主题

  • 41 篇 fixed-parameter ...
  • 5 篇 phylogenetic tre...
  • 4 篇 approximation al...
  • 3 篇 np-hard problem
  • 3 篇 feedback vertex ...
  • 3 篇 rspr distance
  • 2 篇 cluster editing
  • 2 篇 graph algorithms
  • 2 篇 approximation al...
  • 2 篇 computational co...
  • 2 篇 kernelization
  • 2 篇 phylogeny
  • 2 篇 communication de...
  • 2 篇 tree editing dis...
  • 2 篇 graph-based clus...
  • 2 篇 branch and reduc...
  • 2 篇 feedback arc set
  • 2 篇 traveling salesm...
  • 2 篇 tree assembly pr...
  • 2 篇 vegetation

机构

  • 4 篇 novosibirsk stat...
  • 3 篇 russian acad sci...
  • 3 篇 cent south univ ...
  • 2 篇 rhein westfal th...
  • 2 篇 tokyo denki univ...
  • 2 篇 cent s univ sch ...
  • 2 篇 tech univ berlin
  • 2 篇 cent south univ ...
  • 2 篇 normandie univ u...
  • 2 篇 tu berlin inst s...
  • 2 篇 sorbonne univ li...
  • 1 篇 natl & capodistr...
  • 1 篇 univ warsaw inst...
  • 1 篇 jst erato kawara...
  • 1 篇 natl inst inform...
  • 1 篇 hungkuang univ d...
  • 1 篇 tech univ eindho...
  • 1 篇 univ texas rio g...
  • 1 篇 city univ hong k...
  • 1 篇 friedrich schill...

作者

  • 5 篇 wang lusheng
  • 5 篇 chen zhi-zhong
  • 5 篇 van bevern rene
  • 4 篇 wang jianxin
  • 3 篇 shi feng
  • 3 篇 kawarabayashi ke...
  • 3 篇 otachi yota
  • 3 篇 kakimura naonori
  • 3 篇 zhang zhen
  • 3 篇 komusiewicz chri...
  • 2 篇 chang maw-shang
  • 2 篇 harada youta
  • 2 篇 dorbec paul
  • 2 篇 lecoq romain
  • 2 篇 kordon alix muni...
  • 2 篇 rossmanith peter
  • 2 篇 courtiel julien
  • 2 篇 feng qilong
  • 2 篇 gima tatsuya
  • 2 篇 tang ning

语言

  • 39 篇 英文
  • 1 篇 其他
检索条件"主题词=Fixed-parameter algorithm"
41 条 记 录,以下是1-10 订阅
排序:
A fixed-parameter algorithm for a unit-execution-time unit-communication-time tasks scheduling problem with a limited number of identical processors
收藏 引用
RAIRO-OPERATIONS RESEARCH 2022年 第5期56卷 3777-3788页
作者: Kordon, Alix Munier Tang, Ning Sorbonne Univ LIP6 CNRS F-75005 Paris France
This paper considers the minimization of the maximum lateness for a set of dependent tasks with unit duration, unit communication delays release times and due dates. The number of processors is limited, and each task ... 详细信息
来源: 评论
Improved fixed-parameter algorithm for the Tree Containment Problem on Unrooted Phylogenetic Network
收藏 引用
IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS 2022年 第6期19卷 3539-3552页
作者: Shi, Feng Li, Hangcheng Rong, Guozhen Zhang, Zhen Wang, Jianxin Cent South Univ Sch Comp Sci & Engn Changsha 410083 Peoples R China Cent South Univ Hunan Prov Key Lab Bioinformat Changsha 410083 Peoples R China
Phylogenetic trees are unable to represent the evolutionary process for a collection of species if reticulation events happened, and a generalized model named phylogenetic network was introduced consequently. However,... 详细信息
来源: 评论
A fixed-parameter algorithm for Scheduling Unit Dependent Tasks with Unit Communication Delays  27th
A Fixed-Parameter Algorithm for Scheduling Unit Dependent Ta...
收藏 引用
27th International European Conference on Parallel and Distributed Computing (Euro-Par)
作者: Tang, Ning Kordon, Alix Munier Sorbonne Univ LIP6 CNRS F-75005 Paris France
This paper considers the minimization of the makespan for a set of dependent tasks with unit duration and unit communication delays. Given an upper bound of the makespan, release dates and deadlines of the tasks can b... 详细信息
来源: 评论
A fixed-parameter algorithm for the maximum agreement forest problem on multifurcating trees
收藏 引用
Science China(Information Sciences) 2016年 第1期59卷 66-79页
作者: Feng SHI Jianxin WANG Yufei YANG Qilong FENG Weilong LI Jianer CHEN School of Information Science and Engineering Central South University Department of Computer Science and Engineering Texas A&M University College Station
The Maximum Agreement Forest(MAF) problem on two given phylogenetic trees is an important NP-hard problem in the field of computational biology. In this paper, we study the parameterized version of the MAF problem: gi... 详细信息
来源: 评论
A fixed-parameter algorithm for guarding 1.5D terrains
收藏 引用
THEORETICAL COMPUTER SCIENCE 2015年 595卷 130-142页
作者: Khodakarami, Farnoosh Didehvar, Farzad Mohades, Ali Amirkabir Univ Technol Dept Math & Comp Sci Lab Algorithms & Computat Geometry Tehran Iran
A 1.50 terrain is a region on a plane determined by an x-monotone polygonal chain. A set G of points on the terrain is called a guarding set if every point on the terrain is seen by some point in G. In the 1.5D terrai... 详细信息
来源: 评论
A fixed-parameter algorithm for the vertex cover P3 problem
收藏 引用
INFORMATION PROCESSING LETTERS 2015年 第2期115卷 96-99页
作者: Tu, Jianhua Beijing Univ Chem Technol Sch Sci Beijing 100029 Peoples R China
A subset F of vertices of a graph G is called a vertex cover P-t set if every path of order t in G contains at least one vertex from F. Denote by psi t(G) the minimum cardinality of a vertex cover P-t set in G. The ve... 详细信息
来源: 评论
Orientable burning number of graphs☆
收藏 引用
DISCRETE APPLIED MATHEMATICS 2025年 367卷 116-128页
作者: Courtiel, Julien Dorbec, Paul Gima, Tatsuya Lecoq, Romain Otachi, Yota Normandie Univ UNICAEN ENSICAEN CNRSGREYC F-14000 Caen France Hokkaido Univ Sapporo Japan Nagoya Univ Nagoya Japan
In this paper, we introduce the problem of finding an orientation of a given undirected graph that maximizes the burning number of the resulting directed graph. We show that the problem is polynomial-time solvable on ... 详细信息
来源: 评论
Orientable Burning Number of Graphs  18th
Orientable Burning Number of Graphs
收藏 引用
18th International Conference and Workshops on algorithms and Computation (WALCOM)
作者: Courtiel, Julien Dorbec, Paul Gima, Tatsuya Lecoq, Romain Otachi, Yota Normandie Univ UNICAEN ENSICAEN CNRSGREYC F-14000 Caen France Nagoya Univ Nagoya Aichi Japan
In this paper, we introduce the problem of finding an orientation of a given undirected graph that maximizes the burning number of the resulting directed graph. We show that the problem is polynomial-time solvable on ... 详细信息
来源: 评论
fixed-parameter tractability for the Tree Assembly problem
收藏 引用
THEORETICAL COMPUTER SCIENCE 2021年 886卷 3-12页
作者: Shi, Feng You, Jie Zhang, Zhen Liu, Jingyi Wang, Jianxin Cent South Univ Sch Comp Sci & Engn Changsha 410083 Peoples R China Cent South Univ Hunan Prov Key Lab Bioinformat Changsha 410083 Peoples R China Alibaba Grp Hangzhou 311121 Peoples R China
Calculating the "distance" between two given objects with respect to a designated "editing" operation is a hot research area in bioinformatics, where the "distance" is always defined as t... 详细信息
来源: 评论
fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2018年 第2期270卷 419-429页
作者: Cambazard, Hadrien Catusse, Nicolas Univ Grenoble Alpes CNRS Grenoble INP G SCOP F-38000 Grenoble France
Given a set P of n points with their pairwise distances, the traveling salesman problem (TSP) asks for a shortest tour that visits each point exactly once. A TSP instance is rectilinear when the points lie in the plan... 详细信息
来源: 评论