1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
2. G. Di Battista and E. Nardelli,An Algorithm for Testing Planarity of Hierarchical Graphs, Lecture Notes in Computer Science, Vol. 246, Springer-Verlag, Berlin, 1987, pp. 277?289.
3. B. Berger and P. Shor, Approximation Algorithms for the Maximum Acyclic Subgraph Problem,Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, 1990, pp. 236?243.
4. J. A. Bondy and U. S. R. Murty,Graph Theory with Applications, Macmillan, New York, 1976.
5. P. Eades and D. Kelly, Heuristics for Reducing Crossings in 2-Layered Networks,Ars Combinatoria 21A (1986), 89?98.