咨询与建议

限定检索结果

文献类型

  • 60 篇 期刊文献
  • 7 篇 会议
  • 1 篇 学位论文
  • 1 篇 资讯

馆藏范围

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

日期分布

学科分类号

  • 52 篇 工学
    • 49 篇 计算机科学与技术...
    • 12 篇 软件工程
    • 2 篇 电气工程
    • 1 篇 电子科学与技术(可...
    • 1 篇 安全科学与工程
  • 34 篇 理学
    • 33 篇 数学
    • 2 篇 生物学
    • 1 篇 统计学(可授理学、...
  • 10 篇 管理学
    • 10 篇 管理科学与工程(可...
    • 1 篇 工商管理
  • 2 篇 法学
    • 2 篇 法学
  • 1 篇 经济学
    • 1 篇 应用经济学
  • 1 篇 农学

主题

  • 69 篇 fixed-parameter ...
  • 8 篇 computational bi...
  • 7 篇 kernelization
  • 7 篇 parameterized co...
  • 6 篇 graph algorithms
  • 5 篇 approximation al...
  • 5 篇 computational co...
  • 4 篇 computational st...
  • 4 篇 set packing
  • 4 篇 the closest stri...
  • 4 篇 treewidth
  • 3 篇 np-hard problems
  • 3 篇 rank-width
  • 3 篇 haplotyping
  • 3 篇 crown decomposit...
  • 3 篇 planar graphs
  • 2 篇 branch-decomposi...
  • 2 篇 phylogenetics
  • 2 篇 split graphs
  • 2 篇 satisfiability p...

机构

  • 5 篇 city univ hong k...
  • 4 篇 simon fraser uni...
  • 4 篇 tokyo denki univ...
  • 3 篇 technion israel ...
  • 3 篇 mit comp sci & a...
  • 2 篇 univ bonn bonn
  • 2 篇 city univ hong k...
  • 2 篇 med univ lubeck ...
  • 2 篇 budapest univ te...
  • 2 篇 univ milano bico...
  • 2 篇 tu hamburg inst ...
  • 2 篇 lebanese amer un...
  • 2 篇 univ jena inst i...
  • 2 篇 tu wien algorith...
  • 2 篇 hamburg univ tec...
  • 2 篇 czech tech univ ...
  • 2 篇 city univ hong k...
  • 2 篇 univ waterloo sc...
  • 2 篇 univ bergen dept...
  • 2 篇 natl & capodistr...

作者

  • 7 篇 chen zhi-zhong
  • 6 篇 mnich matthias
  • 6 篇 wang lusheng
  • 6 篇 dondi riccardo
  • 5 篇 komusiewicz chri...
  • 4 篇 jia xiaohua
  • 4 篇 marzban marjan
  • 4 篇 abu-khzam faisal...
  • 4 篇 gu qian-ping
  • 3 篇 eiben eduard
  • 3 篇 ganian robert
  • 3 篇 marx daniel
  • 3 篇 razgon igor
  • 3 篇 tantau till
  • 3 篇 ma bin
  • 2 篇 pilipczuk marcin
  • 2 篇 sorge manuel
  • 2 篇 schlotter ildiko
  • 2 篇 elberfeld michae...
  • 2 篇 zoppis italo

语言

  • 60 篇 英文
  • 9 篇 其他
检索条件"主题词=Fixed-parameter algorithms"
69 条 记 录,以下是11-20 订阅
排序:
A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion
收藏 引用
JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2018年 97卷 121-146页
作者: Eiben, Eduard Ganian, Robert Kwon, O-joung Univ Bergen Dept Informat Bergen Norway TU Wien Algorithms & Complex Grp Vienna Austria Incheon Natl Univ Dept Math 119 Acad Ro Incheon South Korea
Vertex deletion problems ask whether it is possible to delete at most k vertices from a graph so that the resulting graph belongs to a specified graph class. Over the past years, the parameterized complexity of vertex... 详细信息
来源: 评论
Almost 2-SAT is fixed-parameter tractable
收藏 引用
JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2009年 第8期75卷 435-450页
作者: Razgon, Igor O'Sullivan, Barry Univ Coll Cork Dept Comp Sci Cork Constraint Computat Ctr Cork Ireland
We consider the following problem. Given a 2-CNF formula, is it possible to remove at most k clauses so that the resulting 2-CNF formula is satisfiable? This problem is known to different research communities in theor... 详细信息
来源: 评论
Constant ratio fixed-parameter approximation of the edge multicut problem
收藏 引用
INFORMATION PROCESSING LETTERS 2009年 第20期109卷 1161-1166页
作者: Marx, Daniel Razgon, Igor Natl Univ Ireland Univ Coll Cork Cork Constraint Computat Ctr Cork Ireland Budapest Univ Technol & Econ Dept Comp Sci & Informat Theory Budapest Hungary
The input of the Edge Multicut problem consists of an undirected graph G and pairs of terminals {s(1), t(1)),...,{s(m), t(m));the task is to remove a minimum set of edges such that s(i) and t(i) are disconnected for e... 详细信息
来源: 评论
FPT algorithms for path-transversal and cycle-transversal problems
收藏 引用
DISCRETE OPTIMIZATION 2011年 第1期8卷 61-71页
作者: Guillemot, Sylvain Univ Paris Est Inst Gaspard Monge F-77454 Champs Sur Marne Marne La Vallee France
We study the parameterized complexity of several vertex- and edge-deletion problems on graphs, parameterized by the number p of deletions. The first kind of problems are separation problems on undirected graphs, where... 详细信息
来源: 评论
New analysis and computational study for the planar connected dominating set problem
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2016年 第1期32卷 198-225页
作者: Marzban, Marjan Gu, Qian-Ping Jia, Xiaohua Simon Fraser Univ Sch Comp Sci Burnaby BC V5A 1S6 Canada City Univ Hong Kong Dept Comp Sci Kowloon Hong Kong Peoples R China
The connected dominating set (CDS) problem is a well studied NP-hard problem with many important applications. Dorn et al. (Algorithmica 58:790-810 2010) introduce a branch-decomposition based algorithm design techniq... 详细信息
来源: 评论
Simultaneous Identification of Duplications, Losses, and Lateral Gene Transfers
收藏 引用
IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS 2012年 第5期9卷 1515-1528页
作者: Chen, Zhi-Zhong Deng, Fei Wang, Lusheng Tokyo Denki Univ Div Informat Syst Design Hatoyama Saitama 3590394 Japan City Univ Hong Kong Dept Comp Sci Kowloon Hong Kong Peoples R China
We give a fixed-parameter algorithm for the problem of enumerating all minimum-cost LCA-reconciliations involving gene duplications, gene losses, and lateral gene transfers (LGTs) for a given species tree S and a give... 详细信息
来源: 评论
An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems
收藏 引用
DISCRETE APPLIED MATHEMATICS 2015年 193卷 145-161页
作者: Komusiewicz, Christian Sorge, Manuel TU Inst Softwaretech & Theoret Informat Berlin Germany
We investigate the computational complexity of the DENSEST k-SUBGRAPH problem, where the input is an undirected graph G = (V, E) and one wants to find a subgraph on exactly k vertices with the maximum number of edges.... 详细信息
来源: 评论
parameterized and approximation algorithms for finding two disjoint matchings
收藏 引用
THEORETICAL COMPUTER SCIENCE 2014年 第0期556卷 85-93页
作者: Chen, Zhi-Zhong Fan, Ying Wang, Lusheng Tokyo Denki Univ Div Informat Syst Design Hatoyama Saitama 3500394 Japan City Univ Hong Kong Dept Comp Sci Kowloon Hong Kong Peoples R China
We first present a randomized fixed-parameter algorithm for the NP-hard problem of deciding if there are two matchings M-1 and M-2 in a given graph G such that vertical bar M-1 vertical bar+ vertical bar M-2 vertical ... 详细信息
来源: 评论
THE UNIFORM MINIMUM-ONES 2SAT PROBLEM AND ITS APPLICATION TO HAPLOTYPE CLASSIFICATION
收藏 引用
RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS 2010年 第3期44卷 363-377页
作者: Boeckenhauer, Hans-Joachim Forisek, Michal Oravec, Jan Steffen, Bjoern Steinhoefel, Kathleen Steinova, Monika ETH Dept Comp Sci Zurich Switzerland Comenius Univ Dept Comp Sci Bratislava 81806 Slovakia Kings Coll London Dept Comp Sci London England
Analyzing genomic data for finding those gene variations which are responsible for hereditary diseases is one of the great challenges in modern bioinformatics. In many living beings (including the human), every gene i... 详细信息
来源: 评论
Designing and implementing algorithms for the closest string problem
收藏 引用
THEORETICAL COMPUTER SCIENCE 2019年 786卷 32-43页
作者: Yuasa, Shota Chen, Zhi-Zhong Ma, Bin Wang, Lusheng Tokyo Denki Univ Div Informat Syst Design Hatoyama Saitama 3500394 Japan Univ Waterloo Sch Comp Sci 200 Univ Ave W Waterloo ON N2L 3G1 Canada City Univ Hong Kong Dept Comp Sci Kowloon Tat Chee Ave Hong Kong Peoples R China City Univ Hong Kong Shenzhen Res Inst Shenzhen Hitech Ind Pk Shenzhen Peoples R China
Given a set of n strings of length L and a radius d, the closest string problem (CSP for short) asks for a string t(sol) that is within a Hamming distance of d to each of the given strings. It is known that the proble... 详细信息
来源: 评论