Untangling planar graphs from a specified vertex position—Hard cases期刊界 All Journals 搜尽天下杂志传播学术成果专业期刊搜索期刊信息化学术搜索

按检索

Untangling planar graphs from a specified vertex position—Hard cases

Authors:	M KangO Pikhurko A RavskyM Schacht O Verbitsky

Institution:	^a Institut für Informatik, Humboldt Universität zu Berlin, D-10099 Berlin, Germany ^b Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA 15213, United States ^c Institute for Applied Problems of Mechanics and Mathematics, Naukova St. 3Б, Lviv 79060, Ukraine

Abstract:

Keywords:	Combinatorial geometry Graph drawing Planar graphs Untangling problem
本文献已被 ScienceDirect 等数据库收录！