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 条

[31] Fractons on Graphs and Complexity
Gorantla, Pranay
Lam, Ho Tat
Shao, Shu-Heng
arXiv, 2022,
[32] AN EFFICIENT ALGORITHM FOR THE TRANSITIVE CLOSURE AND A LINEAR WORST-CASE COMPLEXITY RESULT FOR A CLASS OF SPARSE GRAPHS
JAUMARD, B
MINOUX, M
INFORMATION PROCESSING LETTERS, 1986, 22 (04) : 163 - 169
[33] ON THE COMPLEXITY OF GRAPHS AND MOLECULES
BERTZ, SH
BULLETIN OF MATHEMATICAL BIOLOGY, 1983, 45 (05) : 849 - 855
[34] ON THE COMPLEXITY OF REINFORCEMENT IN GRAPHS
Rad, Nader Jafari
DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2016, 36 (04) : 877 - 887
[35] Fractons on graphs and complexity
Gorantla, Pranay
Lam, Ho Tat
Shao, Shu-Heng
PHYSICAL REVIEW B, 2022, 106 (19)
[36] THE COMPLEXITY OF CUBICAL GRAPHS
AFRATI, F
PAPADIMITRIOU, CH
PAPAGEORGIOU, G
LECTURE NOTES IN COMPUTER SCIENCE, 1984, 172 : 51 - 57
[37] SWITCHING GRAPHS AND THEIR COMPLEXITY
MEINEL, C
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 379 : 350 - 359
[38] On the complexity of molecular graphs
Nikolic, S
Tolic, IM
Trinajstic, N
MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 1999, (40) : 187 - 201
[39] ON THE COMPLEXITY OF FINITE GRAPHS
CHASHKIN, AV
DOKLADY AKADEMII NAUK, 1995, 340 (06) : 748 - 750
[40] THE COMPLEXITY OF CUBICAL GRAPHS
AFRATI, F
PAPADIMITRIOU, CH
PAPAGEORGIOU, G
INFORMATION AND CONTROL, 1985, 66 (1-2): : 53 - 60

← 1 2 3 4 5 →