咨询与建议

限定检索结果

文献类型

  • 164 篇 期刊文献
  • 71 篇 会议
  • 5 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 195 篇 工学
    • 185 篇 计算机科学与技术...
    • 46 篇 软件工程
    • 5 篇 电气工程
    • 3 篇 控制科学与工程
    • 1 篇 石油与天然气工程
    • 1 篇 生物工程
  • 120 篇 理学
    • 119 篇 数学
    • 3 篇 统计学(可授理学、...
    • 2 篇 生物学
  • 15 篇 管理学
    • 15 篇 管理科学与工程(可...
    • 4 篇 工商管理
  • 4 篇 经济学
    • 4 篇 应用经济学
  • 2 篇 法学
    • 2 篇 法学
  • 1 篇 医学
    • 1 篇 临床医学

主题

  • 240 篇 parameterized al...
  • 29 篇 graph algorithms
  • 24 篇 kernelization
  • 22 篇 treewidth
  • 20 篇 approximation al...
  • 14 篇 exact algorithms
  • 14 篇 parameterized co...
  • 10 篇 dynamic programm...
  • 7 篇 planar graphs
  • 6 篇 tree decompositi...
  • 6 篇 vertex cover
  • 6 篇 steiner tree
  • 5 篇 graphs
  • 5 篇 tournaments
  • 5 篇 exponential time...
  • 5 篇 branchwidth
  • 5 篇 chordal graphs
  • 5 篇 minimum fill-in
  • 5 篇 graph minors
  • 5 篇 feedback vertex ...

机构

  • 16 篇 univ elect sci &...
  • 16 篇 univ bergen dept...
  • 13 篇 univ bergen berg...
  • 9 篇 univ bergen dept...
  • 9 篇 univ trier fb ab...
  • 8 篇 univ montpellier...
  • 8 篇 inst math sci ma...
  • 6 篇 inst math sci ch...
  • 6 篇 ben gurion univ ...
  • 5 篇 univ warsaw inst...
  • 5 篇 hbni inst math s...
  • 4 篇 texas a&m univ d...
  • 4 篇 ben gurion univ ...
  • 4 篇 tu wien algorith...
  • 4 篇 univ bergen dept...
  • 4 篇 texas a&m univ d...
  • 3 篇 indian inst tech...
  • 3 篇 univ bergen n-50...
  • 3 篇 depaul univ sch ...
  • 3 篇 univ saarland d-...

作者

  • 25 篇 saurabh saket
  • 21 篇 thilikos dimitri...
  • 19 篇 xiao mingyu
  • 16 篇 fernau henning
  • 15 篇 fomin fedor v.
  • 15 篇 lokshtanov danie...
  • 8 篇 raman venkatesh
  • 8 篇 zehavi meirav
  • 7 篇 knop dusan
  • 7 篇 sau ignasi
  • 6 篇 pilipczuk marcin
  • 6 篇 hecher markus
  • 6 篇 panolan fahad
  • 6 篇 golovach petr a.
  • 6 篇 ramanujan m. s.
  • 6 篇 gaspers serge
  • 6 篇 fichte johannes ...
  • 6 篇 stamoulis gianno...
  • 5 篇 ordyniak sebasti...
  • 5 篇 pilipczuk michal

语言

  • 225 篇 英文
  • 15 篇 其他
检索条件"主题词=Parameterized Algorithms"
240 条 记 录,以下是71-80 订阅
排序:
A parameterized Algorithm for Bounded-Degree Vertex Deletion  22nd
A Parameterized Algorithm for Bounded-Degree Vertex Deletion
收藏 引用
22nd International Computing and Combinatorics Conference (COCOON)
作者: Xiao, Mingyu Univ Elect Sci & Technol China Sch Comp Sci & Engn Chengdu Peoples R China
The d-bounded-degree vertex deletion problem, to delete at most k vertices in a given graph to make the maximum degree of the remaining graph at most d, finds applications in computational biology, social network anal... 详细信息
来源: 评论
parameterized Results on Acyclic Matchings with Implications for Related Problems  1
收藏 引用
49th International Workshop on Graph-Theoretic Concepts in Computer Science (WG)
作者: Chaudhary, Juhi Zehavi, Meirav Ben Gurion Univ Negev Dept Comp Sci Beer Sheva Israel
A matchingM in a graph G is an acyclic matching if the subgraph of G induced by the endpoints of the edges of M is a forest. Given a graph G and a positive integer l, Acyclic Matching asks whether G has an acyclic mat... 详细信息
来源: 评论
A parameterized shared-memory scheme for parameterized metaheuristics
A parameterized shared-memory scheme for parameterized metah...
收藏 引用
2nd Mini-Symposium on High Performance Computing (HPC) Applied to Computational Problems in Science and Engineering/10th International Conference on Computational and Mathematical Methods in Science and Engineering
作者: Almeida, Francisco Gimenez, Domingo Lopez-Espin, Jose J. Univ Murcia Dept Informat & Sistemas Murcia Spain Univ La Laguna Dept Estadist Invest Operat & Comp E-38207 San Cristobal la Laguna Spain Univ Miguel Hernandez Ctr Invest Operat Elche Spain
This paper presents a parameterized shared-memory scheme for parameterized metaheuristics. The use of a parameterized metaheuristic facilitates experimentation with different metaheuristics and hybridation/combination... 详细信息
来源: 评论
An Improved FPT Algorithm for Independent Feedback Vertex Set
收藏 引用
THEORY OF COMPUTING SYSTEMS 2020年 第8期64卷 1317-1330页
作者: Li, Shaohua Pilipczuk, Marcin Univ Warsaw Inst Informat Warsaw Poland
We study the INDEPENDENT FEEDBACK VERTEX SET problem - a variant of the classic FEEDBACK VERTEX SET problem where, given a graph G and an integer k, the problem is to decide whether there exists a vertex set S. V (G) ... 详细信息
来源: 评论
New and improved algorithms for unordered tree inclusion
收藏 引用
THEORETICAL COMPUTER SCIENCE 2021年 883卷 83-98页
作者: Akutsu, Tatsuya Jansson, Jesper Li, Ruiming Takasu, Atsuhiro Tamura, Takeyuki Kyoto Univ Bioinformat Ctr Inst Chem Res Uji Kyoto 6110011 Japan Hong Kong Polytech Univ Dept Comp Hung Hom Kowloon Hong Kong Peoples R China Kyoto Univ Grad Sch Informat Sakyo Ku Yoshida Honmachi Kyoto 6068501 Japan Natl Inst Informat Chiyoda Ku Tokyo 1018430 Japan
The tree inclusion problem is, given two node-labeled trees P and T (the "pattern tree" and the "target tree"), to locate every minimal subtree in T (if any) that can be obtained by applying a sequ... 详细信息
来源: 评论
Fixed-parameter algorithms for artificial intelligence, constraint satisfaction and database problems
收藏 引用
COMPUTER JOURNAL 2008年 第3期51卷 303-325页
作者: Gottlob, Georg Szeider, Stefan Univ Durham Sci Labs Dept Comp Sci Durham DH1 3LE England Univ Oxford Comp Lab Oxford OX1 3QD England
We survey the parameterized complexity of problems that arise in artificial intelligence, database theory and automated reasoning. In particular, we consider various parameterizations of the constraint satisfaction pr... 详细信息
来源: 评论
Multiple hypernode hitting sets and smallest two-cores with targets
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2009年 第3期18卷 294-306页
作者: Damaschke, Peter Chalmers Univ Dept Comp Sci & Engn S-41296 Gothenburg Sweden
The multiple weighted hitting set problem is to find a subset of nodes in a hypergraph that hits every hyperedge in at least m nodes. We extend the problem to a notion of hypergraphs with so-called hypernodes and show... 详细信息
来源: 评论
Using nondeterminism to design efficient deterministic algorithms
收藏 引用
ALGORITHMICA 2004年 第2期40卷 83-97页
作者: Chen, JN Friesen, DK Jia, WJ Kanj, IA Texas A&M Univ Dept Comp Sci College Stn TX 77843 USA City Univ Hong Kong Dept Comp Engn & Informat Technol Kowloon Hong Kong Peoples R China DePaul Univ Sch CTI Chicago IL 60604 USA
In this paper we illustrate how nondeterminism can be used conveniently and effectively in designing efficient deterministic algorithms. In particular, our method gives a parameterized algorithm of running time O((5.7... 详细信息
来源: 评论
An improved upper bound for SAT
收藏 引用
THEORETICAL COMPUTER SCIENCE 2021年 887卷 51-62页
作者: Chu, Huairui Xiao, Mingyu Zhang, Zhe Univ Elect Sci & Technol China Sch Comp Sci & Engn Chengdu Peoples R China
We show that the CNF satisfiability problem can be solved in 0*(1.2226(m)) time, where m is the number of clauses in the formula, improving the known upper bounds 0*(1.234(m)) given by Yamamoto 15 years ago and 0*(1.2... 详细信息
来源: 评论
A polynomial approximation algorithm for the minimum fill-in problem
收藏 引用
SIAM JOURNAL ON COMPUTING 2000年 第4期30卷 1067-1079页
作者: Natanzon, A Shamir, R Sharan, R Tel Aviv Univ Dept Comp Sci IL-69978 Tel Aviv Israel
In the minimum fill-in problem, one wishes to nd a set of edges of smallest size, whose addition to a given graph will make it chordal. The problem has important applications in numerical algebra and has been studied ... 详细信息
来源: 评论