Embedding a Graph in the Grid of a Surface with the Minimum Number of Bends is NP-hard.

Maria Angeles Garrido Alberto Márquez

Published in: Graph Drawing (1997)

Keyphrases

np hard
small number
three dimensional
computational complexity
special case
clustering algorithm
high dimensional
connected components
random graphs
constant factor
spectral embedding