Randomly removing g handles at once

doi:10.1145/1542362.1542425

SIGN IN SIGN UP

Randomly removing g handles at once

Full Text:

Pdf

Buy this Article

Authors:	Glencora Borradaile	University of Waterloo, Waterloo, ON, Canada
	James R. Lee	University of Washington, Seattle, WA, USA
	Anastasios Sidiropoulos	University of Toronto, Toronto, ON, Canada

Published in:

	· Proceeding
	SCG '09 Proceedings of the 25th annual symposium on Computational geometry
	ACM New York, NY, USA ©2009 table of contents ISBN: 978-1-60558-501-7 doi>10.1145/1542362.1542425

	2009 Article
Bibliometrics
· Downloads (6 Weeks): 1 · Downloads (12 Months): 13 · Citation Count: 2

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref
Upcoming Conference:
- SoCG '12

Share:

|

Tags: algorithms bounded genus graphs embeddings general planar graphs probabilistic approximation theory

Feedback | Switch to single page view (no tabs)

**Javascript is not enabled and is required for the "tabbed view" or switch to the single page view**

Powered by

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player

The ACM Guide to Computing Literature

All Tags

Export Formats

Save to Binder