Graph Isomorphism, Color Refinement, and Compactness-Reference-Cited by-同舟云学术

Graph Isomorphism, Color Refinement, and Compactness

Published:2016-12-19 Issue:3 Volume:26 Page:627-685
ISSN:1016-3328
Container-title:computational complexity
language:en
Short-container-title:comput. complex.

Author:

Arvind V.,Köbler Johannes,Rattan Gaurav,Verbitsky Oleg

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science

Link

http://link.springer.com/article/10.1007/s00037-016-0147-6/fulltext.html

Reference43 articles.

1. Dana Angluin (1980). Local and global properties in networks of processors. In Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 82–93. ACM.

2. V. Arvind, Johannes Köbler, Gaurav Rattan & Oleg Verbitsky (2015a). On the power of color refinement. In Proceedings of the 20th International Symposium on Fundamentals of Computation Theory (FCT), volume 9210 of Lecture Notes in Computer Science, 339–350. Springer.

3. V. Arvind, Johannes Köbler, Gaurav Rattan & Oleg Verbitsky (2015b). On Tinhofer’s linear programming approach to isomorphism testing. In Proceedings of the 40th International Symposium on Mathematical Foundations of Computer Science (MFCS), volume 9235 of Lecture Notes in Computer Science, 26–37. Springer.

4. Atserias Albert, Maneva Elitza N. (2013) Sherali-Adams relaxations and indistinguishability in counting logics. SIAM Journal on Computing 42(1): 112–137

5. László Babai (1995). Automorphism groups, isomorphism, reconstruction. In Handbook of Combinatorics, chapter 27, 1447–1540. Elsevier.

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Combinatorial refinement on circulant graphs;computational complexity;2024-07-15

2. On the Weisfeiler–Leman Dimension of Permutation Graphs;SIAM Journal on Discrete Mathematics;2024-06-21

3. The Weisfeiler–Leman Dimension of Distance-Hereditary Graphs;Graphs and Combinatorics;2023-07-14

4. On pseudofrobenius imprimitive association schemes;Journal of Algebraic Combinatorics;2022-12-29

5. On WL-rank of Deza Cayley graphs;Discrete Mathematics;2022-02