Treewidth and the computational complexity of MAP Approximations

被引：0
|
作者：
机构：
[1] Kwisthout, Johan
来源：
Kwisthout, Johan (j.kwisthout@donders.ru.nl) | 1600年 / Springer Verlag卷 / 8754期
关键词：
D O I：
10.1007/978-3-319-11433-0_18
中图分类号：
O144 [集合论]; O157 [组合数学（组合学）];
学科分类号：
070104 ;
摘要：
引用
收藏
相关论文
共 50 条
  • [1] Treewidth and the Computational Complexity of MAP Approximations
    Kwisthout, Johan
    PROBABILISTIC GRAPHICAL MODELS, 2014, 8754 : 271 - 285
  • [2] Tree-width and the computational complexity of MAP approximations in Bayesian networks
    Kwisthout, Johan (j.kwisthout@donders.ru.nl), 1600, AI Access Foundation (53):
  • [3] Tree-Width and the Computational Complexity of MAP Approximations in Bayesian Networks
    Kwisthout, Johan
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2015, 53 : 699 - 720
  • [4] On the Impact of Treewidth in the Computational Complexity of Freezing Dynamics
    Goles, Eric
    Montealegre, Pedro
    Rios Wilson, Martin
    Theyssier, Guillaume
    CONNECTING WITH COMPUTABILITY, 2021, 12813 : 260 - 272
  • [5] On treewidth approximations
    Bouchitté, V
    Kratsch, D
    Müller, H
    Todinca, I
    DISCRETE APPLIED MATHEMATICS, 2004, 136 (2-3) : 183 - 196
  • [6] Computational aspects of graph treewidth
    Bykova, V. V.
    PRIKLADNAYA DISKRETNAYA MATEMATIKA, 2011, 13 (03): : 65 - 79
  • [7] Recognizing Map Graphs of Bounded Treewidth
    Patrizio Angelini
    Michael A. Bekos
    Giordano Da Lozzo
    Martin Gronemann
    Fabrizio Montecchiani
    Alessandra Tappini
    Algorithmica, 2024, 86 : 613 - 637
  • [8] Extension Complexity, MSO Logic, and Treewidth
    Kolman, Petr
    Koutecky, Martin
    Tiwary, Hans Raj
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2020, 22 (04):
  • [9] Recognizing Map Graphs of Bounded Treewidth
    Angelini, Patrizio
    Bekos, Michael A.
    Da Lozzo, Giordano
    Gronemann, Martin
    Montecchiani, Fabrizio
    Tappini, Alessandra
    ALGORITHMICA, 2024, 86 (02) : 613 - 637
  • [10] On the complexity of some colorful problems parameterized by treewidth
    Fellows, Michael R.
    Fomin, Fedor V.
    Lokshtanov, Daniel
    Rosamond, Frances
    Saurabh, Saket
    Szeider, Stefan
    Thomassen, Carsten
    INFORMATION AND COMPUTATION, 2011, 209 (02) : 143 - 153
12345