首页 | 本学科首页   官方微博 | 高级检索  
     


A Polynomial Bound for Untangling Geometric Planar Graphs
Affiliation:1. School of Computer Science, Carleton University, Ottawa, Canada;2. Departament de Matemàtica Aplicada II, Universitat Politècnica de Catalunya, Barcelona, Spain;3. Chercheur Qualifié du FNRS, Département d''Informatique, Université Libre de Bruxelles, Brussels;1. Graz University of Technology, Austria;2. University of Texas at Dallas, U.S.A.;3. University of Wisconsin-Milwaukee, U.S.A.;4. Universidad de Zaragoza, Spain;5. Universitat Politècnica de Catalunya, Spain;6. Ibaraki University, Japan;7. Universidad de Sevilla, Spain;8. Queen''s University, Canada;9. Hebrew University, Israel;10. Tufts University, U.S.A.;11. Universidad Nacional Autónoma de México, México;1. Courant Institute, New York University, 251 Mercer Street, New York, NY 10012-1110, USA;1. School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, ON, Canada, K1S 5B6;2. Department of Computer Science, University of Waterloo, Waterloo, ON, Canada, N2L 3G1
Abstract:
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号