The parameterised complexity of list problems on graphs of bounded treewidth

被引：4
|
作者：
Meeks, Kitty [1 ,2 ]
Scott, Alexander [1 ]
机构：
[1] Univ Oxford, Math Inst, Radcliffe Observ Quarter, Andrew Wiles Bldg,Woodstock Rd, Oxford OX2 6GG, England
[2] Univ Glasgow, Sch Math & Stat, 15 Univ Gardens, Glasgow G12 8QW, Lanark, Scotland
来源：
INFORMATION AND COMPUTATION | 2016年 / 251卷
关键词：
Parameterised complexity; Bounded treewidth; Graph colouring; List colouring; Hamilton path; NP-COMPLETENESS; CHROMATIC INDEX; TOTAL COLORINGS; EDGE;
D O I：
10.1016/j.ic.2016.08.001
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We consider the parameterised complexity of several list problems on graphs, with parameter treewidth or pathwidth. In particular, we show that LIST EDGE CHROMATIC NUMBER and LIST TOTAL CHROMATIC NUMBER are fixed parameter tractable, parameterised by treewidth, whereas LIST HAMILTON PATH is W[1]-hard, even parameterised by pathwidth. These results resolve two open questions of Fellows, Fomin, Lokshtanov, Rosamond, Saurabh, Szeider and Thomassen (2011). (C) 2016 Elsevier Inc. All rights reserved.
引用
收藏
页码：91 / 103
页数：13
相关论文
共 50 条
  • [1] Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds
    Focke, Jacob
    Marx, Daniel
    Rzazewski, Pawel
    PROCEEDINGS OF THE 2022 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2022, : 431 - 458
  • [2] Counting List Homomorphisms from Graphs of Bounded Treewidth: Tight Complexity Bounds
    Focke, Jacob
    Marx, Daniel
    Rzazewski, Pawel
    ACM TRANSACTIONS ON ALGORITHMS, 2024, 20 (02)
  • [3] Finding List Homomorphisms from Bounded-treewidth Graphs to Reflexive Graphs: a Complete Complexity Characterization
    Egri, Laszlo
    Marx, Daniel
    Rzazewski, Pawel
    35TH SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2018), 2018, 96
  • [4] List Homomorphisms by Deleting Edges and Vertices: Tight Complexity Bounds for Bounded-Treewidth Graphs
    Esmer, Barış Can
    Focke, Jacob
    Marx, Dániel
    Rzążewski, Pawel
    Leibniz International Proceedings in Informatics, LIPIcs, 308
  • [5] Equitable list tree-coloring of bounded treewidth graphs
    Li, Yan
    Zhang, Xin
    THEORETICAL COMPUTER SCIENCE, 2021, 855 : 61 - 67
  • [6] Tree-coloring problems of bounded treewidth graphs
    Bi Li
    Xin Zhang
    Journal of Combinatorial Optimization, 2020, 39 : 156 - 169
  • [7] A framework for network reliability problems on graphs of bounded treewidth
    Wolle, T
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2002, 2518 : 137 - 149
  • [8] Tree-coloring problems of bounded treewidth graphs
    Li, Bi
    Zhang, Xin
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2020, 39 (01) : 156 - 169
  • [9] A Method to Reduce the Space Complexity of Algorithms for Bounded Treewidth Graphs
    Zheng, Weikun
    Yin, HaiXiang
    ITESS: 2008 PROCEEDINGS OF INFORMATION TECHNOLOGY AND ENVIRONMENTAL SYSTEM SCIENCES, PT 2, 2008, : 630 - 635
  • [10] Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
    Guo, Jiong
    Hueffner, Falk
    Kenar, Erhan
    Niedermeier, Rolf
    Uhlmann, Johannes
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 186 (02) : 542 - 553
12345