Abstract

ion and Object-Oriented Programming in C++ ", John Wiley & Sons, 1990 [26] L.J. Guibas, R. Sedgewick: " A Dichromatic Framework for Balanced Trees", Proceedings of the 19th IEEE Symposium on Foundations of Computer Science, 8-21, 1978 [27] Goldberg, R.E.Tarjan: "A New Approach to the Maximum Flow Problem", Journal of the ACM, Vol. 35, 921-940, 1988 [28] J.E. Hopcroft, R.M. Karp: "An O(n 2:5 ) Algorithm for Matching in Bipartite Graphs", SIAM Journal of Computing, Vol. 4, 225-231, 1975 [29] J.E. Hopcroft, R.E. Tarjan: "Efficient Planarity Testing", Journal of the ACM, Vol. 21, 549-568, 1974 [30] T. Hagerup, C. Uhrig: "Triangulating a Planar Map Without Introducing multiple Arcs", unpublished, 1989 [31] A.B. Kahn: "Topological Sorting of Large Networks", Communications of the ACM, Vol. 5, 558-562, 1962 BIBLIOGRAPHY 185 [32] J.B. Kruskal: "On the Shortest Spanning Subtree of a Graph and the Travelling Salesman Problem", Proc. American Math. Society 7, 48-50, 1956 [33] E.L. Lawle...

Citations