咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

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

主题

  • 238 篇 parameterized al...
  • 29 篇 graph algorithms
  • 24 篇 kernelization
  • 21 篇 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

语言

  • 223 篇 英文
  • 13 篇 其他
检索条件"主题词=Parameterized Algorithms"
238 条 记 录,以下是141-150 订阅
排序:
Representative Families of Product Families
收藏 引用
ACM TRANSACTIONS ON algorithms 2017年 第3期13卷 36-36页
作者: Fomin, Fedor V. Lokshtanov, Daniel Panolan, Fahad Saurabh, Saket Univ Bergen Dept Informat N-5020 Bergen Norway HBNI Inst Math Sci Madras Tamil Nadu India HBNI Inst Math Sci Theoret Comp Sci Madras 600113 Tamil Nadu India Univ Bergen Bergen Norway
A subfamily F' of a set family F is said to q-represent F if for every A is an element of F and B of size q such that A boolean AND B = empty set there exists a set A' is an element of F' such that A' ... 详细信息
来源: 评论
Faster Exact and parameterized Algorithm for Feedback Vertex Set in Tournaments  33
Faster Exact and Parameterized Algorithm for Feedback Vertex...
收藏 引用
33rd Symposium on Theoretical Aspects of Computer Science (STACS)
作者: Kumar, Mithilesh Lokshtanov, Daniel Univ Bergen Dept Informat Bergen Norway
A tournament is a directed graph T such that every pair of vertices is connected by an arc. A feedback vertex set is a set S of vertices in T such that T - S is acyclic. In this article we consider the FEEDBACK VERTEX... 详细信息
来源: 评论
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... 详细信息
来源: 评论
A faster fixed parameter algorithm for two-layer crossing minimization
收藏 引用
INFORMATION PROCESSING LETTERS 2016年 第9期116卷 547-549页
作者: Kobayashi, Yasuaki Tamaki, Hisao Gakushuin Univ Toshima Ku 1-5-1 Mejiro Tokyo 1718588 Japan Meiji Univ Tama Ku 1-1-1 Higashimita Kawasaki Kanagawa 2148571 Japan Kyoto Univ Sakyo Ku Kyoto 6068501 Japan
We give an algorithm that decides whether the bipartite crossing number of a given graph is at most k. The running time of the algorithm is upper bounded by 2(O(k)) + n(O(1)), where n is the number of vertices of the ... 详细信息
来源: 评论
Computations by fly-automata beyond monadic second-order logic
收藏 引用
THEORETICAL COMPUTER SCIENCE 2016年 619卷 32-67页
作者: Courcelle, Bruno Durand, Irene CNRS LaBRI 351 Cours Liberat F-33405 Talence France Bordeaux Univ 351 Cours Liberat F-33405 Talence France
The validity of a monadic-second order (MS) expressible property can be checked in linear time on graphs of bounded tree-width or clique-width given with appropriate decompositions. This result is proved by constructi... 详细信息
来源: 评论
Between Treewidth and Clique-Width
收藏 引用
ALGORITHMICA 2016年 第1期75卷 218-253页
作者: Saether, Sigve Hortemo Telle, Jan Arne Univ Bergen Dept Informat N-5008 Bergen Norway
Many hard graph problems can be solved efficiently when restricted to graphs of bounded treewidth, and more generally to graphs of bounded clique-width. But there is a price to be paid for this generality, exemplified... 详细信息
来源: 评论
parameterized algorithms for d-HITTING SET: The weighted case
收藏 引用
THEORETICAL COMPUTER SCIENCE 2010年 第16-18期411卷 1698-1713页
作者: Fernau, Henning Univ Trier FB Abt Informat 4 D-54286 Trier Germany Univ Tubingen D-72074 Tubingen Germany Univ Hertfordshire Hatfield AL10 9AB Herts England
We are going to analyze search tree algorithms for WEIGHTED d-HITTING SET. Although the algorithms that we develop are fairly simple, their analysis is technically involved. We compare the weighted case with the previ... 详细信息
来源: 评论
Polynomial Kernels for Deletion to Classes of Acyclic Digraphs  33
Polynomial Kernels for Deletion to Classes of Acyclic Digrap...
收藏 引用
33rd Symposium on Theoretical Aspects of Computer Science (STACS)
作者: Mnich, Matthias van Leeuwen, Erik Jan Univ Bonn Bonn Germany Max Planck Inst Informat Saarbrucken Germany
We consider the problem to find a set X of vertices (or arcs) with vertical bar X vertical bar <= k in a given digraph G such that D = G - X is an acyclic digraph. In its generality, this is DIRECTED FEEDBACK VERTE... 详细信息
来源: 评论
Between Treewidth and Clique-Width  40
收藏 引用
40th International Workshop on Graph-Theoretic Concepts in Computer Science (WG)
作者: Saether, Sigve Hortemo Telle, Jan Arne Univ Bergen Dept Informat N-5008 Bergen Norway
Many hard graph problems can be solved efficiently when restricted to graphs of bounded treewidth, and more generally to graphs of bounded clique-width. But there is a price to be paid for this generality, exemplified... 详细信息
来源: 评论
Exact algorithms via Monotone Local Search  16
Exact Algorithms via Monotone Local Search
收藏 引用
48th Annual ACM SIGACT Symposium on Theory of Computing (STOC)
作者: Fomin, Fedor V. Gaspers, Serge Lokshtanov, Daniel Saurabh, Saket Univ Bergen Bergen Norway UNSW Australia Sydney NSW Australia CSIRO Data61 Canberra ACT Australia Inst Math Sci Madras Tamil Nadu India
We give a new general approach for designing exact exponential -time algorithms for subset problems. In a subset problem the input implicitly describes a family of sets over a universe of size n and the task is to det... 详细信息
来源: 评论