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 条
  • [41] COMPLEXITY OF PARTIAL SATISFACTION
    LIEBERHERR, KJ
    SPECKER, E
    JOURNAL OF THE ACM, 1981, 28 (02) : 411 - 421
  • [42] Sparse Kneser graphs are Hamiltonian
    Mutze, Torsten
    Nummenpalo, Jerri
    Walczak, Bartosz
    JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 2021, 103 (04): : 1253 - 1275
  • [43] Cycle lengths in sparse graphs
    Sudakov, Benny
    Verstraetet, Jacques
    COMBINATORICA, 2008, 28 (03) : 357 - 372
  • [44] The niche category of sparse graphs
    Bowser, S
    Cable, C
    ARS COMBINATORIA, 2003, 66 : 179 - 192
  • [45] Exploring sparse graphs with advice
    Bockenhauer, Hans-Joachim
    Fuchs, Janosch
    Unger, Walter
    INFORMATION AND COMPUTATION, 2022, 289
  • [46] Clustering powers of sparse graphs
    Nesetril, Jaroslav
    de Mendez, Patrice Ossona
    Pilipczuk, Michal
    Zhu, Xuding
    ELECTRONIC JOURNAL OF COMBINATORICS, 2020, 27 (04): : 1 - 20
  • [47] Graded sparse graphs and matroids
    Lee, Audrey
    Streinu, Ileana
    Theran, Louis
    JOURNAL OF UNIVERSAL COMPUTER SCIENCE, 2007, 13 (11) : 1671 - 1679
  • [48] The diameter of sparse random graphs
    Chung, F
    Lu, LY
    ADVANCES IN APPLIED MATHEMATICS, 2001, 26 (04) : 257 - 279
  • [49] Homomorphisms of sparse signed graphs
    Charpentier, Clement
    Naserasr, Reza
    Sopena, Eric
    ELECTRONIC JOURNAL OF COMBINATORICS, 2020, 27 (03): : 1 - 28
  • [50] Sparse graphs and an augmentation problem
    Kiraly, Csaba
    Mihalyko, Andras
    MATHEMATICAL PROGRAMMING, 2022, 192 (1-2) : 119 - 148
12345