568 CHAPTER 17. THE OPEN GRAPH DRAWING FRAMEWORK (OGDF)
[HJ04] S. Hachul and M. J¨unger. Drawing large graphs with a potential-field-
based multilevel algorithm. In Janos Pach, editor, Proc. Graph Draw-
ing 2004, volume 3383 of Lecture Notes Comput. Sci., pages 285–295.
Springer-Verlag, 2004.
[HT73a] J. Hopcroft and R. E. Tarjan. Dividing a graph into triconnected compo-
nents. SIAM J. Comput., 2(3):135–158, 1973.
[HT73b] J. E. Hopcroft and R. E. Tarjan. Efficient algorithms for graph manipu-
lation. Communications of the ACM, 16(6):372–378, 1973.
[JLM98] M. J¨unger, S. Leipert, and P. Mutzel. A note on computing a maximal
planar subgraph using PQ-trees. IEEE Transactions on Computer-Aided
Design, 17(7):609–612, 1998.
[JT00] M. J¨unger and S. Thienel.