List Homomorphisms by Deleting Edges and Vertices: Tight Complexity Bounds for Bounded-Treewidth Graphs

被引：0
|
作者：
Esmer, Barış Can [1 ,2 ]
Focke, Jacob [1 ]
Marx, Dániel [1 ]
Rzążewski, Pawel [3 ,4 ]
机构：
[1] CISPA Helmholtz Center for Information Security, Saarbrücken, Germany
[2] Saarbrücken Graduate School of Computer Science, Saarland Informatics Campus, Germany
[3] Warsaw University of Technology, Poland
[4] University of Warsaw, Poland
来源：
Leibniz International Proceedings in Informatics, LIPIcs | / 308卷
关键词：
1102.1; -; 1106.1; 1201.7; 1201.8; 1201.9;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Polynomial approximation
引用
收藏
相关论文
共 44 条
  • [21] Equitable list tree-coloring of bounded treewidth graphs
    Li, Yan
    Zhang, Xin
    THEORETICAL COMPUTER SCIENCE, 2021, 855 : 61 - 67
  • [22] A tight lower bound for Vertex Planarization on graphs of bounded treewidth
    Pilipczuk, Marcin
    DISCRETE APPLIED MATHEMATICS, 2017, 231 : 211 - 216
  • [23] Bi-arc graphs and the complexity of list homomorphisms
    Feder, T
    Hell, P
    Huang, J
    JOURNAL OF GRAPH THEORY, 2003, 42 (01) : 61 - 80
  • [24] 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
  • [25] Efficient list cost Coloring of vertices and/or edges of some sparse graphs
    Giaro, Krzysztof
    Kubale, Marek
    NUMERICAL ANALYSIS AND APPLIED MATHEMATICS, 2007, 936 : 241 - +
  • [26] On the limit distributions of the degrees of vertices in configuration graphs with a bounded number of edges
    Pavlov, Yu. L.
    Khvorostyanskaya, E. V.
    SBORNIK MATHEMATICS, 2016, 207 (03) : 400 - 417
  • [27] 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
  • [28] Hitting minors on bounded treewidth graphs. III. Lower bounds
    Baste, Julien
    Sau, Ignasi
    Thilikos, Dimitrios M.
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2020, 109 : 56 - 77
  • [29] Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality is the Key to Single-Exponential Parameterized Algorithms
    Bonnet, Edouard
    Brettell, Nick
    Kwon, O-joung
    Marx, Daniel
    ALGORITHMICA, 2019, 81 (10) : 3890 - 3935
  • [30] Acyclic edge colourings of graphs with the number of edges linearly bounded by the number of vertices
    Faculty of Mathematics, Computer Science and Econometrics, University of Zielona Góra, Z. Szafrana 4a, 65-516 Zielona Góra, Poland
    Inf. Process. Lett., 6 (287-290):
12345