Describing Graphs: A First-Order Approach to Graph Canonization-Reference-Cited by-同舟云学术

Describing Graphs: A First-Order Approach to Graph Canonization

Published:1990 Issue: Volume: Page:59-81
ISSN:
Container-title:Complexity Theory Retrospective
language:
Short-container-title:

Author:

Immerman Neil,Lander Eric

Publisher

Springer New York

Link

http://link.springer.com/content/pdf/10.1007/978-1-4612-4478-3_5.pdf

Reference31 articles.

1. A.V. Aho, J.E. Hopcroft and J.D. Ullman (1974), The Design and Analysis of Computer Algorithms, Addison- Wesley.

2. Laszlo Babai, “Moderately Exponential Bound for Graph Isomorphism,” Proc. Conf. on Fundamentals of Computation Theory, Szeged, August 1981.

3. L. Babai, W.M. Kantor, E.M. Luks, “Computational Complexity and the Classification of Finite Simple Groups, ” 24th IEEE FOCS Symp., (1983), 162–171.

4. Laszlo Babai and Luděk Kučera (1980), “Canonical Labelling of Graphs in Linear Average Time,” 20th IEEE Symp. on Foundations of Computer Science, 39–46.

5. Laszlo Babai and Eugene M. Luks, “Canonical Labeling of Graphs,” 15th ACM STOC Symp., (1983), 171–183.

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

1. Bounding the Weisfeiler-Leman Dimension via a Depth Analysis of I/R-Trees;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08

2. From Quantifier Depth to Quantifier Number: Separating Structures with k Variables;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08

3. First order distinguishability of sparse random graphs;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08

4. Are Targeted Messages More Effective?;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08

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