论文信息 - On circular layouts

On circular layouts

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.

Erkki Mäkinen

[1] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[2] David S. Johnson,et al. Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[3] Carlo Batini,et al. A layout algorithm for data flow diagrams , 1986, IEEE Transactions on Software Engineering.

[4] Oliver Vornberger,et al. On Some Variants of the Bandwidth Minimization Problem , 1984, SIAM J. Comput..

[5] Robert Sedgewick,et al. A system for algorithm animation , 1984, SIGGRAPH.

[6] Robert Sedgewick,et al. Techniques for Algorithm Animation , 1985, IEEE Software.

[7] Richard J. Lipton,et al. A method for drawing graphs , 1985, SCG '85.

[8] Carlo Batini,et al. Computer aided layout of entity relationship diagrams , 1984, J. Syst. Softw..