Planar embeddability of the vertices of a graph using a fixed point set is NP-hard

DSpace/Manakin Repository

Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
 
Cabello, S.
(2003) Utrecht University Repository
(Report)
Download/Full Text
Open Access version via Utrecht University Repository Unknown
 
Keywords: Ordered by external client
Publisher: Utrecht University: Information and Computing Sciences
 
See more statistics about this item