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

Maria Angeles Garrido, Alberto Márquez. Embedding a Graph in the Grid of a Surface with the Minimum Number of Bends is NP-hard. In Giuseppe Di Battista, editor, Graph Drawing, 5th International Symposium, GD 97, Rome, Italy, September 18-20, 1997, Proceedings. Volume 1353 of Lecture Notes in Computer Science, pages 124-133, Springer, 1997.

Abstract

Abstract is missing.