Deep Weisfeiler Leman
Deep Weisfeiler Leman
复制标题
深·维斯菲勒·莱曼
DOI:
10.1137/1.9781611976465.154
复制
发表时间:
2021
期刊:
影响因子:
--
通讯作者:
D. Wiebking
中科院分区:
文献类型:
--
作者:
M. Grohe;P. Schweitzer;D. Wiebking
We introduce the framework of Deep Weisfeiler Leman algorithms (DeepWL), which allows the design of purely combinatorial graph isomorphism tests that are more powerful than the well-known Weisfeiler-Leman algorithm.We prove that, as an abstract computational model, polynomial-timeDeepWL-algorithms have exactly the same expressiveness as the logic Choiceless Polynomial Time (with counting) introduced by Blass, Gurevich, and Shelah (Ann. Pure Appl. Logic., 1999).It is a well-known open question whether the existence of a polynomial-time graph isomorphism test implies the existence of a polynomial-time canonisation algorithm. Our main technical result states that for each class of graphs (satisfying some mild closure condition), if there is a polynomial-timeDeepWLisomorphism test, then there is a polynomial-time canonisation algorithm for this class. This implies that there is also a logic capturing polynomial time on this class.
登录
查看更多内容
影响因子:
4.3
作者:
Daniel Neuen;Pascal Schweitzer
通讯作者:
Pascal Schweitzer
DOI:
10.1137/1.9781611973402.120
发表时间:
2014-01
期刊:
--
影响因子:
--
作者:
R. O'Donnell;John Wright;Chenggang Wu;Yuan Zhou
通讯作者:
R. O'Donnell;John Wright;Chenggang Wu;Yuan Zhou
DOI:
--
发表时间:
1997
期刊:
Lecture Notes in Logic
影响因子:
--
作者:
M. Otto
通讯作者:
M. Otto
DOI:
10.1109/psct.1987.10319271
发表时间:
1987
期刊:
Proceeding Structure in Complexity Theory
影响因子:
--
作者:
N. Immerman
通讯作者:
N. Immerman
DOI:
10.1007/3-540-56992-8_15
发表时间:
1992
期刊:
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science
影响因子:
--
作者:
E. Grädel;M. Otto
通讯作者:
M. Otto