咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是121-130 订阅
排序:
Mining Maximal Induced Bicliques using Odd Cycle Transversals  19
Mining Maximal Induced Bicliques using Odd Cycle Transversal...
收藏 引用
SIAM International Conference on Data Mining (SDM)
作者: Kloster, Kyle Sullivan, Blair D. Van der Poel, Andrew North Carolina State Univ Raleigh NC 27695 USA
Many common graph data mining tasks take the form of identifying dense subgraphs (e.g. clustering, clique-finding, etc). In biological applications, the natural model for these dense substructures is often a complete ... 详细信息
来源: 评论
Complexity and parameterized algorithms for Cograph Editing
收藏 引用
THEORETICAL COMPUTER SCIENCE 2012年 461卷 45-54页
作者: Liu, Yunlong Wang, Jianxin Guo, Jiong Chen, Jianer Cent South Univ Sch Informat Sci & Engn Changsha 410083 Hunan Peoples R China Hunan Normal Univ Sch Math & Comp Sci Changsha 410013 Hunan Peoples R China Univ Saarland D-66123 Saarbrucken Germany Texas A&M Univ Dept Comp Sci College Stn TX 77843 USA
Cograph Editing is to find for a given graph G = (V, E) a set of at most k edge additions and deletions that transform G into a cograph. The computational complexity of this problem was open in the past. In this paper... 详细信息
来源: 评论
parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices  35
Parameterized Approximation Schemes for Steiner Trees with S...
收藏 引用
35th Symposium on Theoretical Aspects of Computer Science (STACS)
作者: Dvorak, Pavel Feldmann, Andreas Emil Knop, Dusan Masarik, Tomas Toufar, Tomas Vesely, Pavel Charles Univ Prague Comp Sci Inst Prague Czech Republic Charles Univ Prague Dept Appl Math Prague Czech Republic Univ Bergen Dept Informat Bergen Norway
We study the STEINER TREE problem, in which a set of terminal vertices needs to be connected in the cheapest possible way in an edge-weighted graph. This problem has been extensively studied from the viewpoint of appr... 详细信息
来源: 评论
Complexity of Secure Sets
收藏 引用
ALGORITHMICA 2018年 第10期80卷 2909-2940页
作者: Bliem, Bernhard Woltran, Stefan TU Wien Inst Informat Syst 184 2 Favoritenstr 9-11 A-1040 Vienna Austria
A secure set S in a graph is defined as a set of vertices such that for any the majority of vertices in the neighborhood of X belongs to S. It is known that deciding whether a set S is secure in a graph is -complete. ... 详细信息
来源: 评论
FPT algorithms to Enumerate and Count Acyclic and Totally Cyclic Orientations
收藏 引用
Electronic Notes in Theoretical Computer Science 2019年 346卷 655-666页
作者: Farley Soares Oliveira Hidefumi Hiraishi Hiroshi Imai Department of Computer Science The University of Tokyo Tokyo Japan
In this paper, we deal with counting and enumerating problems for two types of graph orientations: acyclic and totally cyclic orientations. Counting is known to be #P-hard for both of them. To circumvent this issue, w... 详细信息
来源: 评论
Default Logic and Bounded Treewidth  1
收藏 引用
12th International Conference on Language and Automata Theory and Applications (LATA)
作者: Fichte, Johannes K. Hecher, Markus Schindler, Irina Tech Univ Wien Vienna Austria Leibniz Univ Hannover Hannover Germany
In this paper, we study Reiter's propositional default logic when the treewidth of a certain graph representation (semi-primal graph) of the input theory is bounded. We establish a dynamic programming algorithm on... 详细信息
来源: 评论
Exploiting Treewidth for Projected Model Counting and Its Limits  21st
Exploiting Treewidth for Projected Model Counting and Its Li...
收藏 引用
21st International Conference on Theory and Applications of Satisfiability Testing (SAT) Held as Part of the Federated Logic Conference (FloC)
作者: Fichte, Johannes K. Hecher, Markus Morak, Michael Woltran, Stefan TU Wien Inst Log & Computat Vienna Austria
In this paper, we introduce a novel algorithm to solve projected model counting (PMC). PMC asks to count solutions of a Boolean formula with respect to a given set of projected variables, where multiple solutions that... 详细信息
来源: 评论
Locating the Eigenvalues for Graphs of Small Clique-Width  13th
Locating the Eigenvalues for Graphs of Small Clique-Width
收藏 引用
13th Latin American Theoretical Informatics Symposium (LATIN)
作者: Furer, Martin Hoppen, Carlos Jacobs, David P. Trevisan, Vilmar Penn State Univ Dept Comp Sci & Engn State Coll PA 16801 USA Univ Fed Rio Grande do Sul Inst Matemat Alegre Brazil Clemson Univ Sch Comp Clemson SC USA
It is shown that if G has clique-width k, and a corresponding tree decomposition is known, then a diagonal matrix congruent to A-cI for constants c, where A is the adjacency matrix of the graph G of order n, can be co... 详细信息
来源: 评论
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem  35
On Structural Parameterizations of the Bounded-Degree Vertex...
收藏 引用
35th Symposium on Theoretical Aspects of Computer Science (STACS)
作者: Ganian, Robert Klute, Fabian Ordyniak, Sebastian TU Wien Algorithms & Complex Grp Vienna Austria FI MU Brno Czech Republic
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... 详细信息
来源: 评论
TREEWIDTH and PATHWIDTH parameterized by the vertex cover number
收藏 引用
DISCRETE APPLIED MATHEMATICS 2017年 第Part1期216卷 114-129页
作者: Chapelle, Mathieu Liedloff, Mathieu Todinca, Loan Villanger, Yngve Univ Paris Est Marne La Vallee IGM LabInfo 5 Bd Descartes Champs Sur Marne F-77454 Marne La Vallee 2 France Univ Orleans LIFO BP 6759 F-45067 Orleans 2 France Univ Bergen Dept Informat N-5020 Bergen Norway
After the number of vertices, Vertex Cover Number is the largest of the classical graph parameters and has more and more frequently been used as a separate parameter in parameterized problems, including problems that ... 详细信息
来源: 评论