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

Return to Article Details Planar embeddability of the vertices of a graph using a fixed point set is NP-hard Download Download PDF