An O(n^3 log n) Deterministic and an O(n^3) Probabilistic Isomorphism Test for Trivalent Graphs

Zvi Galil, Christoph M. Hoffmann, Eugene M. Luks, Claus-Peter Schnorr, Andreas Weber. An O(n^3 log n) Deterministic and an O(n^3) Probabilistic Isomorphism Test for Trivalent Graphs. In 23rd Annual Symposium on Foundations of Computer Science, 3-5 November 1982, Chicago, Illinois, USA. pages 118-125, IEEE, Chicago, Illinois, 1982.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.