咨询与建议

限定检索结果

文献类型

  • 11 篇 期刊文献
  • 1 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 8 篇 工学
    • 8 篇 计算机科学与技术...
    • 1 篇 机械工程
    • 1 篇 电气工程
    • 1 篇 软件工程
  • 7 篇 理学
    • 7 篇 数学
  • 2 篇 管理学
    • 2 篇 管理科学与工程(可...

主题

  • 12 篇 fixed-parameter ...
  • 3 篇 parameterized co...
  • 2 篇 tree-cut width
  • 2 篇 approximation al...
  • 2 篇 clique-width
  • 2 篇 treewidth
  • 2 篇 dynamic programm...
  • 1 篇 branch-width
  • 1 篇 sparse graph
  • 1 篇 rank-width
  • 1 篇 typed task syste...
  • 1 篇 max-cut
  • 1 篇 graph
  • 1 篇 multi-item discr...
  • 1 篇 algorithms
  • 1 篇 multi-module cap...
  • 1 篇 excluded minors
  • 1 篇 planar graph
  • 1 篇 graph algorithm
  • 1 篇 matroid

机构

  • 3 篇 univ athens dept...
  • 2 篇 comp technol ins...
  • 2 篇 cnrs lamsade
  • 2 篇 korea adv inst s...
  • 1 篇 masaryk univ fac...
  • 1 篇 ensiie 1 sq resi...
  • 1 篇 bordeaux univ f-...
  • 1 篇 telecom sudparis...
  • 1 篇 homi bhabha natl...
  • 1 篇 univ bergen dept...
  • 1 篇 inst math sci ch...
  • 1 篇 ben gurion univ ...
  • 1 篇 virginia tech de...
  • 1 篇 korea adv inst s...
  • 1 篇 cnrs lirmm montp...
  • 1 篇 univ lille cnrs ...
  • 1 篇 basic algorithms...
  • 1 篇 it univ copenhag...
  • 1 篇 ens dma cnrs
  • 1 篇 sorbonne univ cn...

作者

  • 4 篇 sau ignasi
  • 3 篇 oum sang-il
  • 3 篇 paul christophe
  • 3 篇 thilikos dimitri...
  • 3 篇 saurabh saket
  • 2 篇 kim eun jung
  • 1 篇 courcelle bruno
  • 1 篇 hlineny petr
  • 1 篇 watel dimitri
  • 1 篇 baste julien
  • 1 篇 kim eunjung
  • 1 篇 kordon alix muni...
  • 1 篇 zehavi meirav
  • 1 篇 kulkarni kartik
  • 1 篇 amini omid
  • 1 篇 dell holger
  • 1 篇 misra neeldhara
  • 1 篇 fomin fedor v
  • 1 篇 bezakova ivona
  • 1 篇 hanen claire

语言

  • 10 篇 英文
  • 2 篇 其他
检索条件"主题词=Fixed-parameter tractable algorithm"
12 条 记 录,以下是11-20 订阅
排序:
An FPT 2-Approximation for Tree-cut Decomposition  13th
An FPT 2-Approximation for Tree-cut Decomposition
收藏 引用
13th International Workshop on Approximation and Online algorithms (WAOA)
作者: Kim, Eunjung Oum, Sang-il Paul, Christophe Sau, Ignasi Thilikos, Dimitrios M. CNRS LAMSADE Paris France Korea Adv Inst Sci & Technol Dept Math Sci Daejeon South Korea Univ Montpellier CNRS LIRMM F-34059 Montpellier France Univ Athens Dept Math Athens Greece Comp Technol Inst Press Diophantus Patras Greece
The tree-cut width of a graph is a graph parameter defined by Wollan [J. Comb. Theory, Ser. B, 110: 47-66, 2015] with the help of tree-cut decompositions. In certain cases, tree-cut width appears to be more adequate t... 详细信息
来源: 评论
An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth
收藏 引用
THEORETICAL COMPUTER SCIENCE 2024年 990卷
作者: Baste, Julien Watel, Dimitri Univ Lille CNRS Cent Lille UMR 9189CRIStAL F-59000 Lille France ENSIIE 1 Sq Resistance F-91000 Evry France Telecom SudParis SAMOVAR 9 Rue Charles Fourier F-91000 Evry France
In this paper, we introduce a problem called MINIMUM SUBTREE PROBLEM WITH DEGREE WEIGHTS, or MTDW. This problem generalized covering tree problems like SPANNING TREE, STEINER TREE, MINIMUM BRANCH VERTICES, MINIMUM LEA... 详细信息
来源: 评论