On circular layouts∗
Erkki Mäkinen · International Journal of Computer Mathematics · 1988
This paper deals with the circular versions of the linear cutwidth and linear dilation minimization problems. We show that also the circular variants of the problems are NP-complete. Moreover, we propose a method for drawing graphs. This method is based on the use of circular layouts.