咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

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

主题

  • 237 篇 parameterized al...
  • 29 篇 graph algorithms
  • 24 篇 kernelization
  • 22 篇 treewidth
  • 19 篇 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

语言

  • 222 篇 英文
  • 13 篇 其他
检索条件"主题词=Parameterized Algorithms"
237 条 记 录,以下是71-80 订阅
排序:
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... 详细信息
来源: 评论
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem
收藏 引用
ALGORITHMICA 2021年 第1期83卷 297-336页
作者: Ganian, Robert Klute, Fabian Ordyniak, Sebastian TU Wien Algorithms & Complex Grp Vienna Austria Univ Utrecht Utrecht Netherlands Univ Sheffield Dept Comp Sci Sheffield S Yorkshire England
We study the parameterized complexity of the Bounded-Degree Vertex Deletion problem (BDD), where the aim is to find a maximum induced subgraph whose maximum degree is below a given degree bound. Our focus lies on para... 详细信息
来源: 评论
On the tractability of (k, i)-coloring
收藏 引用
DISCRETE APPLIED MATHEMATICS 2021年 305卷 329-339页
作者: Bhyravarapu, Sriram Joshi, Saurabh Kalyanasundaram, Subrahmanyam Kare, Anjeneya Swami IIT Hyderabad Dept Comp Sci & Engn Kandi 502285 Telangana India Univ Hyderabad Sch Comp & Informat Sci Gachibowli 500046 Telangana India
In an undirected graph, a proper (k, i)-coloring is an assignment of a set of k colors to each vertex such that any two adjacent vertices have at most i common colors. The (k, i)-coloring problem is to compute the min... 详细信息
来源: 评论
Towards a Polynomial Kernel for Directed Feedback Vertex Set
收藏 引用
ALGORITHMICA 2021年 第5期83卷 1201-1221页
作者: Bergougnoux, Benjamin Eiben, Eduard Ganian, Robert Ordyniak, Sebastian Ramanujan, M. S. Univ Bergen Bergen Norway Royal Holloway Univ London Egham Surrey England Vienna Univ Technol Vienna Austria Univ Sheffield Sheffield S Yorkshire England Univ Warwick Coventry W Midlands England Univ Leeds Sch Comp Leeds LS2 9JT W Yorkshire England
In the Directed Feedback Vertex Set (DFVS) problem, the input is a directed graph D and an integer k. The objective is to determine whether there exists a set of at most k vertices intersecting every directed cycle of... 详细信息
来源: 评论
Generalizations of Comparability Graphs
Generalizations of Comparability Graphs
收藏 引用
作者: Xu, Zhisheng Colorado State University
学位级别:Ph.D., Doctor of Philosophy
In rational decision-making models, transitivity of preferences is an important principle. In a transitive preference, one who prefers x to y and y to z must prefer x to z. Many preference relations, including total o... 详细信息
来源: 评论
New parameterized algorithms for the edge dominating set problem
收藏 引用
THEORETICAL COMPUTER SCIENCE 2013年 511卷 147-158页
作者: Xiao, Mingyu Kloks, Ton Poon, Sheung-Hung Univ Elect Sci & Technol China Sch Comp Sci & Engn Chengdu 610054 Peoples R China Natl Tsing Hua Univ Dept Comp Sci Hsinchu Taiwan
An edge dominating set of a graph G = (V, E) is a subset M subset of E of edges in the graph such that each edge in E M is incident with at least one edge in M. In an instance of the parameterized edge dominating set ... 详细信息
来源: 评论
Packing Arc-Disjoint Cycles in Tournaments
收藏 引用
ALGORITHMICA 2021年 第5期83卷 1393-1420页
作者: Bessy, Stephane Bougeret, Marin Krithika, R. Sahu, Abhishek Saurabh, Saket Thiebaut, Jocelyn Zehavi, Meirav Univ Montpellier CNRS LIRMM Montpellier France Indian Inst Technol Palakkad Palakkad India HBNI Inst Math Sci Chennai Tamil Nadu India Ben Gurion Univ Negev Beer Sheva Israel
A tournament is a directed graph in which there is a single arc between every pair of distinct vertices. Given a tournament T on n vertices, we explore the classical and parameterized complexity of the problems of det... 详细信息
来源: 评论
Efficient computation of the oriented chromatic number of recursively defined digraphs
收藏 引用
INTERNATIONAL JOURNAL OF CARDIOLOGY 2021年 343卷 16-35页
作者: Gurski, Frank Komander, Dominique Lindemann, Marvin Heinrich Heine Univ Inst Comp Sci Algorithm Hard Problems Grp D-40225 Dusseldorf Germany
In this paper we consider colorings of oriented graphs, i.e. digraphs without cycles of length 2. Given some oriented graph G = (V, E), an oriented r-coloring for G is a partition of the vertex set V into r independen... 详细信息
来源: 评论
Assigning times to minimise reachability in temporal graphs
收藏 引用
JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2021年 115卷 169-186页
作者: Enright, Jessica Meeks, Kitty Skerman, Fiona Univ Glasgow Sch Comp Sci Glasgow Lanark Scotland Uppsala Univ Dept Math Uppsala Sweden
Temporal graphs (in which edges are active at specified times) are of particular relevance for spreading processes on graphs, e.g. the spread of disease or dissemination of information. Motivated by real-world applica... 详细信息
来源: 评论
Finding Temporal Paths Under Waiting Time Constraints
收藏 引用
ALGORITHMICA 2021年 第9期83卷 2754-2802页
作者: Casteigts, Arnaud Himmel, Anne-Sophie Molter, Hendrik Zschoche, Philipp Univ Bordeaux Bordeaux INP CNRS LaBRI Bordeaux France Tech Univ Berlin Algorithm & Computat Complex Berlin Germany
Computing a (short) path between two vertices is one of the most fundamental primitives in graph algorithmics. In recent years, the study of paths in temporal graphs, that is, graphs where the vertex set is fixed but ... 详细信息
来源: 评论