Improving the crossing lemma by finding more crossings in sparse graphs: [extended abstract]

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: János Pach NYU, New York, NY
Radoš Radoicić Massachusetts Institute of Technology, Cambridge, MA
Gábor Tardos Rényi Institute, Budapest, Hungary
Géza Tóth Rényi Institute, Budapest, Hungary
Improving the crossing lemma by finding more crossings in sparse graphs: [extended abstract] Published by ACM 2004 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 12
· Downloads (cumulative): 305
· Citation Count: 7

Published in:
Cover Image
 
· Proceeding
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Pages 68-75
ACM New York, NY, USA ©2004
table of contents ISBN:1-58113-885-7 doi>10.1145/997817.997831

Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 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