An O(N^(1.5+epsilon)) Expected Time Algorithm for Canonization and Isomorphism Testing of Trivalent Garphs - researchr publication

researchr

You are not signed in
Sign in
Sign up

Ludek Kucera. An O(N^(1.5+epsilon)) Expected Time Algorithm for Canonization and Isomorphism Testing of Trivalent Garphs. In Kurt Mehlhorn, editor, STACS 85, 2nd Symposium of Theoretical Aspects of Computer Science, Saarbrücken, Germany, January 3-5, 1985, Proceedings. Volume 182 of Lecture Notes in Computer Science, pages 197-207, Springer, 1985.

Abstract is missing.

runs on WebDSL