From Invariants to Canonization in Parallel-Reference-Cited by-同舟云学术

From Invariants to Canonization in Parallel

Published: Issue: Volume: Page:216-227
ISSN:
Container-title:Computer Science – Theory and Applications
language:
Short-container-title:

Author:

Köbler Johannes,Verbitsky Oleg

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-79709-8_23.pdf

Reference24 articles.

1. Lecture Notes in Computer Science;V. Arvind,2006

2. Arvind, V., Torán, J.: Isomorphism testing: Pespective and open problems. Bulletin of the European Association of Theoretical Computer Science 86, 66–84 (2005)

3. Babai, L., Luks, E.: Canonical labeling of graphs. In: Proc. 15th ACM Symposium on Theory of Computing, pp. 171–183. ACM Press, New York (1983)

4. Lecture Notes in Computer Science;B.S. Chlebus,1988

5. Filotti, I.S., Mayer, J.N.: A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus. In: Proc. 12th ACM Symposium on Theory of Computing, pp. 236–243. ACM Press, New York (1980)

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

1. Count-free Weisfeiler–Leman and group isomorphism;International Journal of Algebra and Computation;2024-04-03

2. On the Parallel Complexity of Group Isomorphism via Weisfeiler–Leman;Fundamentals of Computation Theory;2023

3. Graph Kernels: State-of-the-Art and Future Challenges;Foundations and Trends® in Machine Learning;2020

4. UPPER BOUNDS ON THE QUANTIFIER DEPTH FOR GRAPH DIFFERENTIATION IN FIRST-ORDER LOGIC;LOG METH COMPUT SCI;2019

5. Towards an Isomorphism Dichotomy for Hereditary Graph Classes;Theory of Computing Systems;2017-06-21