Advertisement

An O(N1.5+ε) expected time algorithm for canonization and isomorphism testing of trivalent graphs

  • Luděk Kučera
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 182)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    L.Babai, W.M.Kantor, E.M.Luks, Computational complexity and the classification of finite simple semigroups, 24th Annual Symposium on Foundations of Computer Science, 1983, 162–171Google Scholar
  2. [2]
    L.Babai, L.Kučera, Canonical labelling of graphs in linear average time, 20th Annual Symposium on Foundations of Computer Science, 1979, 39–46.Google Scholar
  3. [3]
    L.Babai, E.M.Luks, Canonical labeling of graphs, 15th Annual Symposium on Theory of Computation,,1983, 171–183.Google Scholar
  4. [4]
    M.Fürer, W.Schnyder, E.Specker, Normal forms for trivalent graphs and graphs of bounded valence, 15th Annual Symposium on Theory of Computation, 1983,171–183.Google Scholar
  5. [5]
    Z.Galil, C.M.Hoffman, E.M.Luks, C.P.Schnorr,A.Weber, An O(n3log n) deterministic and O(n3) probabilistic isomorphism test for trivalent graphs, 23rd Annual Symposium on Foundation of Computer Science, 1982, 118–125.Google Scholar
  6. [6]
    E.M. Luks, Isomorphism of graphs of bounded valence can be tested in polynomial time, Journal of Computer and System Sciences 25 1982, 42–65.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Luděk Kučera
    • 1
  1. 1.Charles UniversityPragueCzechoslovakia

Personalised recommendations