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 条
  • [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] Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs
    Focke, Jacob
    Marx, Daniel
    Mc Inerney, Fionn
    Neuen, Daniel
    Sankar, Govind S.
    Schepper, Philipp
    Wellnitz, Philip
    PROCEEDINGS OF THE 2023 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2023, : 3664 - 3683
  • [5] The parameterised complexity of list problems on graphs of bounded treewidth
    Meeks, Kitty
    Scott, Alexander
    INFORMATION AND COMPUTATION, 2016, 251 : 91 - 103
  • [6] Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphs
    Okrasa, Karolina
    Rzazewski, Pawel
    PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 1578 - 1590
  • [7] FINE-GRAINED COMPLEXITY OF THE GRAPH HOMOMORPHISM PROBLEM FOR BOUNDED-TREEWIDTH GRAPHS
    Okrasa, Karolina
    Rzazewski, Pawel
    SIAM JOURNAL ON COMPUTING, 2021, 50 (02) : 487 - 508
  • [8] Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphs
    Okrasa, Karolina
    Rzazewski, Pawel
    PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 1578 - 1590
  • [9] An optimal algorithm for BISECTION for bounded-treewidth graphs
    Hanaka, Tesshu
    Kobayashi, Yasuaki
    Sone, Taiga
    arXiv, 2020,
  • [10] Deleting Vertices to Graphs of Bounded Genus
    Tomasz Kociumaka
    Marcin Pilipczuk
    Algorithmica, 2019, 81 : 3655 - 3691
12345