-

检索结果分析

结果分析中...
检索条件:"关键词=fixed-parameter "
条 记 录,以下是1-6
视图:
排序:
显示条数:
An Overview of Kernelization Algorithms for Graph Modification Problems
《Tsinghua Science and Technology》2014年第4期346-357,共12页Yunlong Liu Jianxin Wang Jiong Guo 
supported by the National Natural Science Foundation of China (Nos. 61070224, 61232001, and 61173051);the China Postdoctoral Science Foundation (No. 2012M521551)
Kernelization algorithms for graph modification problems are important ingredients in parameterized computation theory. In this paper, we survey the kernelization algorithms for four types of graph modification proble...
关键词:graph modification problem fixed-parameter tractable kernelization algorithm 
Parameterized Algorithmics for Computational Social Choice:Nine Research Challenges
《Tsinghua Science and Technology》2014年第4期358-373,共16页Robert Bredereck Jiehua Chen Piotr Faliszewski Jiong Guo Rolf Niedermeier Gerhard J.Woeginger 
supported by the Deutsche Forschungsgemeinschaft, project PAWS (NI 369/10);supported by the Studienstiftung des Deutschen Volkes;supported by DFG "Cluster of Excellence Multimodal Computing and Interaction";supported by DIAMANT (a mathematics cluster of the Netherlands Organization for Scientific Research NWO);the Alexander von Humboldt Foundation, Bonn, Germany
Computational Social Choice is an interdisciplinary research area involving Economics, Political Science,and Social Science on the one side, and Mathematics and Computer Science(including Artificial Intelligence and ...
关键词:NP-hard problems parameterized complexity fixed-parameter tractability kernelization exact algorithms voting decision making cake cutting 
Improved kernels for triangle packing in tournaments
《Science China(Information Sciences)》2023年第5期96-109,共14页Hanchun YUAN Qilong FENG Jianxin WANG 
supported by National Natural Science Foundation of China(Grant Nos.62172446,61872450)。
Triangle packing problem has been paid lots of attention to in the literature.In this paper,we study the kernelization of the triangle packing problem in tournaments.For the parameterized arc-disjoint triangle packing...
关键词:TOURNAMENTS triangle packing KERNELIZATION fixed-parameter tractable graph algorithms 
On Fixed-Parameter Solvability of the Minimax Path Location Problem
《Communications on Applied Mathematics and Computation》2023年第4期1644-1654,共11页Hao Lin Cheng He 
The minimax path location problem is to find a path P in a graph G such that the maximum distance d_(G)(v,P)from every vertex v∈V(G)to the path P is minimized.It is a well-known NP-hard problem in network optimizatio...
关键词:Discrete location Path location Fixed-parameter solvability Graph characterization Polynomial-time algorithm 
A fixed-parameter algorithm for the maximum agreement forest problem on multifurcating trees
《Science China(Information Sciences)》2016年第1期63-76,共14页Feng SHI Jianxin WANG Yufei YANG Qilong FENG Weilong LI Jianer CHEN 
supported by National Natural Science Foundation of China(Grant Nos.61232001;61472449;61370172;61420106009);Research Fund for the Doctoral Program of Higher Education of China(Grant No.20130162130001)
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...
关键词:computational biology multifurcating phylogenetic tree maximum agreement forest TBR dis-tance fixed-parameter algorithm 
Distances Between Phylogenetic Trees: A Survey
《Tsinghua Science and Technology》2013年第5期490-499,共10页Feng Shi Qilong Feng Jianer Chen Lusheng Wang Jianxin Wang 
supported by the National Natural Science Foundation of China (Nos.61103033,61173051, 61232001,and 70921001)
Phylogenetic trees have been widely used in the study of evolutionary biology for representing the tree-like evolution of a collection of species. However, different data sets and different methods often lead to the c...
关键词:phylogenetic tree tree bisection and reconnection subtree prune and regraft fixed-parameter algorithm approximation algorithm 
检索报告 对象比较 聚类工具 使用帮助 返回顶部