Isomorphism of graphs with bounded eigenvalue multiplicity

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1982, Pages 310-324

  Babai, László ^a   Grigoryev, D Yu ^b   Mount, David M ^c  

^a EÖTVÖS LORÁND UNIVERSITY   (Hungary)

^b STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

^c PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION; SET THEORY;

ADJACENCY MATRICES; EIGEN-VALUE; EIGENVALUES; LAS VEGAS ALGORITHMS; POLYNOMIAL-TIME ALGORITHMS; SPECTRUM OF A GRAPH; UNDIRECTED GRAPH;

EIGENVALUES AND EIGENFUNCTIONS;

EID: 85051462782     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/800070.802206     Document Type: Conference Paper

References (22)

1. Babai, L., "Monte Carlo algorithms in graph isomorphism testing," preprint, 1979.
2. Babai, L., "Isomorphism testing and symmetry of graphs," Combinatorics 79 (M. Deza and I. G. Rosenberg, eds.) Ann. Discr. Math. 8, 1980, 101-109.
3. Babai, L., "Moderately exponential bound for isomorphism," Fundamentals of Computation Theory (Proc. Conf. FCT '81, Szeged; F. Gécseg, ed.) Lect. Notes in Comp. Sci. 117, Springer, 1981, 34-50.
4. Biggs, Norman, Algebraic Graph Theory, Cambridge University Press, 1974.
5. Cvetkovic, D., M. Doob and H. Sachs, Spectra of Graphs, Theory and Application, Academic Press, 1980.
6. Furst, M., J. Hopcroft and E. M. Luks, "A subex-ponential algorithm for trivalent graph isomorphism," Tech. Rept. 80-486, Comp. Sci. Dept., Cornell Univ., 1980.
7. Furst, M., J. Hopcroft and E. M. Luks, "Polynomial time algorithms for permutation groups," Proc. 21st IEEE FOCS Symp., 1980, 36-41.
8. O(g)) steps," Proc. 11th ACM STOC Symp., 1979, 27-37
9. Filotti, I. and J. Mayer, "A polynomial time algorithm for determining isomorphism of graphs of fixed genus," Proc. 12th ACM STOC Symp., 1980, 236-243.
10. Hoffmann, C, "Testing isomorphism of cone graphs," Proc. 12th ACM STOC Symp., 1900, 244-251.
11. Hoffmann, C, "On the complexity of intersecting permutation groups and its relationship with graph isomorphism," Tech. Rept. 4/80, Dept, of Informatik, University Kiel, West Germany, 1980.
12. 4) Isomorphism Test for Trivalent Graphs," Manuscript.
13. Hoffmann, C., Group-Theoretic Algorithms and Graph Isomorphism, to appear in Springer Lecture Notes in Comp. Science, March 1982.
14. Hopcroft, J. and R. Tarjan, "A V log V algorithm for isomorphism of triconnected planar graphs," JCSS 7, 1973, 323-331.
15. Hopcroft, J. and J. Wong, "A linear time algorithm for isomorphism of planar graphs," Proc. 6th ACM STOC Symp., 1974, 172-184.
16. Leighton, F. T. and G. L. Miller, "Numerical analysis of Gaussian elimination and eigenspace calculation," in preparation.
17. Leighton, F. T. and G. Miller, "Certificates for Graphs with Distinct Eigenvalues," in preparation.
18. Lichtenstein, D., "Isomorphism for graphs em-beddable on the projective plane," Proc. 13th ACM STOC Symp., 1980, 218-224.
19. Luks, E., "Isomorphism of graphs of bounded valence can be tested in polynomial time," Proc. 21st IEEE FOCS Symp., 1980, 42-49.
20. Mathon, R., "A note on the graph isomorphism counting problem," Inf. Proc. Letters 8, 1978, 131-132.
21. Miller, G., "Isomorphism testing for graphs of bounded genus," Proc. 12th ACM STOC Symp., 1980, 218-224.
22. Sims, C, Computational Problems in Abstract Algebra, Ed. John Leech, Pergamon Press, 1970, pp. 176-177.