A Polynomial-time Algorithm for Determining the Isomorphism of Graphs of Fixed Genus (Working Paper) - researchr publication

researchr

You are not signed in
Sign in
Sign up

I. S. Filotti, Jack N. Mayer. A Polynomial-time Algorithm for Determining the Isomorphism of Graphs of Fixed Genus (Working Paper). In Conference Proceedings of the Twelfth Annual ACM Symposium on Theory of Computing, 28-30 April, Los Angeles, California, USA. pages 236-243, ACM, 1980.

Abstract is missing.

runs on WebDSL