On a New High Dimensional Weisfeiler-Lehman Algorithm

Journal of Algebraic Combinatorics

Volumn 10, Issue 1, 1999, Pages 29-45

  Evdokimov, Sergei ^a   Karpinski, Marek ^b   Ponomarenko, Ilia ^a  

^a ST PETERSBURG INSTITUTE FOR INFORMATICS AND AUTOMATION   (Russian Federation)

^b UNIVERSITY OF BONN   (Germany)

Author keywords

Cellular algebra; Graph isomorphism problem; Permutation group

Indexed keywords

EID: 0347662667     PISSN: 09259899     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1018672019177     Document Type: Article

References (15)

1. G.M. Adelson-Vel'skii, B. Ju. Weisfeiler, A.A. Lehman, and I.A. Faradžev, "On an example of a graph whose automorphism group is not transitive," Soviet Math. Dokl. 10 (1969), 440-441.
2. L. Babai, "On the order of uniprimitive permutation groups," Annals of Math. 113 (1981), 553-568.
3. L. Babai, "Automorphism groups, isomorphism, reconstruction," in Handbook of Combinatorics, R.L. Graham, M. Grötschel, and L. Lovász (Eds.), Elsevier Science, 1995, Vol. 2, pp. 1447-1541.
4. L. Babel, "Computing cellular algebras," (submitted to Combinatorica).
5. J. Cai, M. Fürer, and N. Immerman, "Optimal lower bound on the number of variables for graph identification," Combinatorica 12 (1992), 389-410.
6. S. Evdokimov and I. Ponomarenko, "Bases of primitive cellular algebras," Proc. International Algebraic Conference Dedicated to the Memory of D.K. Faddeev, 1997, pp. 45-46.
7. S. Friedland, "Coherent algebras and the graph isomorphism problem," Discrete Applied Math. 25 (1989), 73-98.
8. M. Garey and D. Johnson, Computers and Intractibility: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
9. D.G. Higman, "Coherent algebras," Linear Algebra Appl. 93 (1987), 209-239.
10. L.A. Kalužnin and M.H. Klin, "On some numerical invariants of permutation groups," Latv. Mat. Ežegod. 18 (1976), 81-99 (in Russian).
11. R.M. Karp and V. Ramachandran, "Parallel algorithms for shared-memory machines," Algorithms and Complexity, 1990, Vol. A 871-942.
12. R. Mathon, "A note on the graph isomorphism counting problem," Inform. Process. Lett. 8 (1979), 131-132.
13. I. Ponomarenko, "On computation complexity problems concerning relation algebras," Zapiski Nauch. Semin. POMI 202 (1992), 116-134 (in Russian).
14. B. Ju. Weisfeiler (ed.), "On construction and identification of graphs," Springer Lecture Notes, 1976, p. 558.
15. H. Wielandt, Finite Permutation Groups, Academic Press, New York - London, 1964.