咨询与建议

限定检索结果

文献类型

  • 821 篇 期刊文献
  • 306 篇 会议
  • 11 篇 学位论文

馆藏范围

  • 1,138 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 943 篇 工学
    • 921 篇 计算机科学与技术...
    • 236 篇 软件工程
    • 40 篇 控制科学与工程
    • 34 篇 电气工程
    • 8 篇 信息与通信工程
    • 6 篇 机械工程
    • 2 篇 生物工程
    • 1 篇 仪器科学与技术
    • 1 篇 电子科学与技术(可...
    • 1 篇 建筑学
    • 1 篇 土木工程
    • 1 篇 测绘科学与技术
    • 1 篇 石油与天然气工程
  • 594 篇 理学
    • 588 篇 数学
    • 9 篇 生物学
    • 4 篇 统计学(可授理学、...
    • 1 篇 物理学
    • 1 篇 化学
  • 104 篇 管理学
    • 104 篇 管理科学与工程(可...
    • 19 篇 工商管理
  • 19 篇 经济学
    • 19 篇 应用经济学
  • 7 篇 法学
    • 7 篇 法学
  • 2 篇 文学
    • 2 篇 外国语言文学
  • 2 篇 农学
    • 1 篇 水产
  • 2 篇 医学
    • 1 篇 基础医学(可授医学...
    • 1 篇 临床医学
  • 1 篇 哲学
    • 1 篇 哲学

主题

  • 1,138 篇 parameterized co...
  • 127 篇 kernelization
  • 97 篇 treewidth
  • 58 篇 computational co...
  • 56 篇 graph algorithms
  • 44 篇 vertex cover
  • 42 篇 algorithms
  • 41 篇 fixed-parameter ...
  • 34 篇 dynamic programm...
  • 27 篇 approximation al...
  • 24 篇 planar graphs
  • 21 篇 fpt
  • 20 篇 exponential time...
  • 20 篇 graph minors
  • 19 篇 theory
  • 19 篇 feedback vertex ...
  • 18 篇 exact algorithms
  • 18 篇 dominating set
  • 18 篇 approximation
  • 17 篇 fixed parameter ...

机构

  • 46 篇 ben gurion univ ...
  • 42 篇 univ bergen berg...
  • 39 篇 univ bergen dept...
  • 38 篇 inst math sci ma...
  • 35 篇 univ bergen dept...
  • 30 篇 hbni inst math s...
  • 20 篇 tu wien algorith...
  • 17 篇 tu berlin inst s...
  • 16 篇 ben gurion univ ...
  • 16 篇 univ montpellier...
  • 14 篇 univ montpellier...
  • 12 篇 tu wien austria
  • 12 篇 univ utrecht utr...
  • 12 篇 univ durham sch ...
  • 12 篇 univ tubingen wi...
  • 11 篇 hbni inst math s...
  • 11 篇 inst math sci ch...
  • 10 篇 max planck inst ...
  • 10 篇 univ calif santa...
  • 10 篇 depaul univ sch ...

作者

  • 93 篇 saurabh saket
  • 59 篇 sau ignasi
  • 47 篇 golovach petr a.
  • 46 篇 lokshtanov danie...
  • 43 篇 zehavi meirav
  • 40 篇 fomin fedor v.
  • 39 篇 niedermeier rolf
  • 35 篇 szeider stefan
  • 32 篇 kratsch stefan
  • 31 篇 ganian robert
  • 29 篇 thilikos dimitri...
  • 26 篇 raman venkatesh
  • 23 篇 ordyniak sebasti...
  • 22 篇 tsur dekel
  • 22 篇 hermelin danny
  • 20 篇 marx daniel
  • 19 篇 panolan fahad
  • 18 篇 fomin fedor v
  • 18 篇 yang yongjie
  • 17 篇 paul christophe

语言

  • 1,071 篇 英文
  • 65 篇 其他
检索条件"主题词=parameterized complexity"
1138 条 记 录,以下是381-390 订阅
排序:
A fixed-parameter algorithm for minimum quartet inconsistency
收藏 引用
JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2003年 第4期67卷 723-741页
作者: Gramm, J Niedermeier, R Univ Tubingen Wilhelm Schickard Inst Informat D-72076 Tubingen Germany
Given n taxa, exactly one topology for every subset of four taxa, and a positive integer k (the parameter), the MINIMUM QUARTET INCONSISTENCY (MQI) problem is the question whether we can find an evolutionary tree indu... 详细信息
来源: 评论
Meta-kernelization with structural parameters
收藏 引用
JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2016年 第2期82卷 333-346页
作者: Ganian, Robert Slivovsky, Friedrich Szeider, Stefan TU Wien Algorithms & Complex Grp A-1040 Vienna Austria
Kernelization is a polynomial-time algorithm that reduces an instance of a parameterized problem to a decision-equivalent instance, the kernel, whose size is bounded by a function of the parameter. In this paper we pr... 详细信息
来源: 评论
On the Computational complexity of Vertex Integrity and Component Order Connectivity
收藏 引用
ALGORITHMICA 2016年 第4期76卷 1181-1202页
作者: Drange, Pal Gronas Dregi, Markus van 't Hof, Pim Univ Bergen Bergen Norway
The Weighted Vertex Integrity (wVI) problem takes as input an n-vertex graph G, a weight function , and an integer p. The task is to decide if there exists a set such that the weight of X plus the weight of a heaviest... 详细信息
来源: 评论
A Fast Algorithm for Permutation Pattern Matching Based on Alternating Runs
收藏 引用
ALGORITHMICA 2016年 第1期75卷 84-117页
作者: Bruner, Marie-Louise Lackner, Martin Vienna Univ Technol Inst Discrete Math & Geometry A-1040 Vienna Austria Vienna Univ Technol Inst Informat Syst A-1040 Vienna Austria
The NP-complete Permutation Pattern Matching problem asks whether a k-permutation P is contained in a n-permutation T as a pattern. This is the case if there exists an order-preserving embedding of P into T. In this p... 详细信息
来源: 评论
Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality is the Key to Single-Exponential parameterized Algorithms
收藏 引用
ALGORITHMICA 2019年 第10期81卷 3890-3935页
作者: Bonnet, Edouard Brettell, Nick Kwon, O-joung Marx, Daniel Univ Claude Bernard Lyon 1 Univ Lyon CNRS ENS LyonLIP UMR5668 Lyon France Eindhoven Univ Technol Dept Math & Comp Sci Eindhoven Netherlands Incheon Natl Univ Dept Math Incheon South Korea Hungarian Acad Sci MTA SZTAKI Inst Comp Sci & Control Budapest Hungary
It has long been known that Feedback Vertex Set can be solved in time 2 O-(w log w) n(O(1)) on n-vertex graphs of treewidth w, but it was only recently that this running time was improved to 2(O(w))n(O(1)), that is, t... 详细信息
来源: 评论
Editing to a Graph of Given Degrees
收藏 引用
THEORETICAL COMPUTER SCIENCE 2015年 591卷 72-84页
作者: Golovach, Petr A. Univ Bergen Dept Informat N-5020 Bergen Norway Russian Acad Sci Steklov Inst Math St Petersburg Moscow 117901 Russia
We consider the EDITING TO A GRAPH OF GIVEN DEGREES problem that asks for a graph G, non-negative integers d,k and a function delta: V(G) -> {1, ... , d}, whether it is possible to obtain a graph G' from G such... 详细信息
来源: 评论
An improved algorithm for the (n, 3)-MaxSAT problem: asking branchings to satisfy the clauses
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2021年 第3期42卷 524-542页
作者: Xu, Chao Li, Wenjun Wang, Jianxin Yang, Yongjie Cent South Univ Sch Comp Sci & Engn Changsha Peoples R China Changsha Univ Sci & Technol Hunan Prov Key Lab Intelligent Proc Big Data Tran Changsha Peoples R China Saarland Univ Econ Theory Saarbrucken Germany
We study the (n, 3)-MaxSAT problem where we are given an integer k and a CNF formula with n variables, each of which appears in at most 3 clauses, and the question is whether there is an assignment that satisfies at l... 详细信息
来源: 评论
Dual Parameterization of Weighted Coloring
收藏 引用
ALGORITHMICA 2020年 第8期82卷 2316-2336页
作者: Araujo, Julio Campos, Victor A. Lima, Carlos Vinicius G. C. dos Santos, Vinicius Fernandes Sau, Ignasi Silva, Ana Univ Fed Ceara Dept Matemat Fortaleza Ceara Brazil Univ Fed Ceara Dept Comp Fortaleza Ceara Brazil Univ Fed Minas Gerais Dept Ciencia Comp Belo Horizonte MG Brazil Univ Montpellier LIRMM CNRS Montpellier France
Given a graph G, a properk-coloring of G is a partition c=(Si)i is an element of[1,k] of V(G) into k stable sets S1, horizontal ellipsis ,Sk. Given a weight function w:V(G)-> R+, the weight of a colorSi is defined ... 详细信息
来源: 评论
Graph Isomorphism parameterized by Elimination Distance to Bounded Degree
收藏 引用
ALGORITHMICA 2016年 第2期75卷 363-382页
作者: Bulian, Jannis Dawar, Anuj Univ Cambridge Comp Lab Pembroke St Cambridge CB2 3QG England
A commonly studied means of parameterizing graph problems is the deletion distance from triviality (Guo et al., parameterized and exact computation, Springer, Berlin, pp. 162-173, 2004), which counts vertices that nee... 详细信息
来源: 评论
A survey of graph layout problems
收藏 引用
ACM COMPUTING SURVEYS 2002年 第3期34卷 313-356页
作者: Díaz, J Petit, J Serna, M Univ Politecn Cataluna Dept Llenguatges & Sistemes Informat ES-08034 Barcelona Spain
Graph layout problems are a particular class of combinatorial optimization problems whose goal is to find a linear layout of an input graph in such way that a certain objective cost is optimized. This survey considers... 详细信息
来源: 评论