Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
Publication date
2003
Authors
Cabello, S.
Editors
Advisors
Supervisors
DOI
Document Type
Report
Metadata
Show full item recordCollections
License
Abstract
Keywords
Ordered by external client
Citation
Cabello, S 2003, Planar embeddability of the vertices of a graph using a fixed point set is NP-hard. vol. 2003-031, UU-CS edn, Utrecht University: Information and Computing Sciences, Utrecht.