Skip to main content
SpringerLink
Log in

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

  • Conference paper
  • First Online:
STACS 85 (STACS 1985)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 182))

Included in the following conference series:

  • 132 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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–171

    Google Scholar 

  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. L.Babai, E.M.Luks, Canonical labeling of graphs, 15th Annual Symposium on Theory of Computation,,1983, 171–183.

    Google Scholar 

  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. 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. 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 

Download references

Author information

Authors and Affiliations

  1. Charles University, Prague, Czechoslovakia

    Luděk Kučera

Authors
  1. Luděk Kučera
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

K. Mehlhorn

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kučera, L. (1984). An O(N1.5+ε) expected time algorithm for canonization and isomorphism testing of trivalent graphs. In: Mehlhorn, K. (eds) STACS 85. STACS 1985. Lecture Notes in Computer Science, vol 182. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024009

Download citation

  • DOI: https://doi.org/10.1007/BFb0024009

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13912-6

  • Online ISBN: 978-3-540-39136-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation