Four Pages are Necessary and Sufficient for Planar Graphs (Extended Abstract) - researchr publication

researchr

You are not signed in
Sign in
Sign up

Mihalis Yannakakis. Four Pages are Necessary and Sufficient for Planar Graphs (Extended Abstract). In Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, 28-30 May 1986, Berkeley, California, USA. pages 104-108, ACM, 1986.

Abstract is missing.

runs on WebDSL