SIGN IN
SIGN UP
Linkless and flat embeddings in 3-space and the unknot problem
Full Text:
Pdf
Buy this Article
Authors:
Ken-ichi Kawarabayashi
National Institute of Informatics, Tokyo, Japan
Stephan Kreutzer
The University of Oxford, Oxford, United Kingdom
Bojan Mohar
Simon Fraser University, Burnaby, Canada
Published in:
· Proceeding
SoCG '10
Proceedings of the 2010 annual symposium on Computational geometry
Pages 97-106
ACM
New York, NY
, USA
©2010
table of contents
ISBN: 978-1-4503-0016-2
doi>
10.1145/1810959.1810975
2010 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 31
· Downloads (cumulative): 158
· Citation Count: 1
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SoCG '13
Share:
|
Tags:
algorithms
combinatorial algorithms
flat embedding
knot
linkless embedding
unknot
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 Guide to Computing Literature
All Tags
Export Formats
Save to Binder