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 条
  • [21] SPARSE GRAPHS ARE NOT FLAMMABLE
    Pralat, Pawel
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2013, 27 (04) : 2157 - 2166
  • [22] SPARSE RAMSEY GRAPHS
    NESETRIL, J
    RODL, V
    COMBINATORICA, 1984, 4 (01) : 71 - 78
  • [23] SPARSE EIGENVECTORS OF GRAPHS
    Teke, Oguzhan
    Vaidyanathan, P. P.
    2017 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2017, : 3904 - 3908
  • [24] SPARSE BROADCAST GRAPHS
    BERMOND, JC
    HELL, P
    LIESTMAN, AL
    PETERS, JG
    DISCRETE APPLIED MATHEMATICS, 1992, 36 (02) : 97 - 130
  • [25] The sparse sequences of graphs
    Huang, Sumin
    Qian, Jianguo
    GRAPHS AND COMBINATORICS, 2024, 40 (06)
  • [26] On the complexity of sparse elimination
    Emiris, IZ
    JOURNAL OF COMPLEXITY, 1996, 12 (02) : 134 - 166
  • [27] Odd coloring of sparse graphs and planar graphs
    Cho, Eun-Kyung
    Choi, Ilkyoo
    Kwon, Hyemin
    Park, Boram
    DISCRETE MATHEMATICS, 2023, 346 (05)
  • [28] On the total choosability of planar graphs and of sparse graphs
    Chang, Gerard Jennhwa
    Hou, Jianfeng
    Roussel, Nicolas
    INFORMATION PROCESSING LETTERS, 2010, 110 (20) : 849 - 853
  • [29] On the Eccentric Complexity of Graphs
    Yaser Alizadeh
    Tomislav Došlić
    Kexiang Xu
    Bulletin of the Malaysian Mathematical Sciences Society, 2019, 42 : 1607 - 1623
  • [30] On the Eccentric Complexity of Graphs
    Alizadeh, Yaser
    Doslic, Tomislav
    Xu, Kexiang
    BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY, 2019, 42 (04) : 1607 - 1623
12345