The Complexity of Satisfaction on Sparse Graphs

被引：0
|
作者：
Dawar, Anuj [1 ]
机构：
[1] Univ Cambridge, Comp Lab, Cambridge CB3 0FD, England
来源：
PARAMETERIZED AND EXACT COMPUTATION | 2010年 / 6478卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：1 / 2
页数：2
相关论文
共 50 条
  • [1] A Complexity Dichotomy for the Coloring of Sparse Graphs
    Esperet, Louis
    Montassier, Mickael
    Ochem, Pascal
    Pinlou, Alexandre
    JOURNAL OF GRAPH THEORY, 2013, 73 (01) : 85 - 102
  • [2] Fine-Grained Complexity for Sparse Graphs
    Agarwal, Udit
    Ramachandran, Vijaya
    STOC'18: PROCEEDINGS OF THE 50TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2018, : 239 - 252
  • [3] The complexity of counting in sparse, regular, and planar graphs
    Vadhan, SP
    SIAM JOURNAL ON COMPUTING, 2001, 31 (02) : 398 - 427
  • [4] Computational Complexity of Hedonic Games on Sparse Graphs
    Hanaka, Tesshu
    Kiya, Hironori
    Maei, Yasuhide
    Ono, Hirotaka
    PRINCIPLES AND PRACTICE OF MULTI-AGENT SYSTEMS (PRIMA 2019), 2019, 11873 : 576 - 584
  • [5] On the Complexity of Scaffolding Problems: From Cliques to Sparse Graphs
    Weller, Mathias
    Chateau, Annie
    Giroudeau, Rodolphe
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, (COCOA 2015), 2015, 9486 : 409 - 423
  • [6] PARAMETERIZED COMPLEXITY OF DIRECTED STEINER TREE ON SPARSE GRAPHS
    Jones, Mark
    Lokshtanov, Daniel
    Ramanujan, M. S.
    Saurabh, Saket
    Suchy, Ondrej
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2017, 31 (02) : 1294 - 1327
  • [7] Parameterized Complexity of Directed Steiner Tree on Sparse Graphs
    Jones, Mark
    Lokshtanov, Daniel
    Ramanujan, M. S.
    Saurabh, Saket
    Suchy, Ondrej
    ALGORITHMS - ESA 2013, 2013, 8125 : 671 - 682
  • [8] The Complexity of Homomorphisms of Signed Graphs and Signed Constraint Satisfaction
    Foucaud, Florent
    Naserasr, Reza
    LATIN 2014: THEORETICAL INFORMATICS, 2014, 8392 : 526 - 537
  • [9] A Universal Low Complexity Compression Algorithm for Sparse Marked Graphs
    Delgosha, Payam
    Anantharam, Venkat
    2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2020, : 2349 - 2354
  • [10] The complexity of counting colourings and independent sets in sparse graphs and hypergraphs
    C. Greenhill
    computational complexity, 2000, 9 : 52 - 72
12345