Literatur

• [AHU83] A.V. Aho, J.E. Hopcroft, J.D. Ullman: Data Structures and Algorithms.
  Addison-Wesley, 1983. (kid 112/a46, lbs 840/a46)
  
  
• [AMO93] R.K. Ahuja: Network Flows.
  Prentice Hall, 1993. (kid 114/a42, lbs 840/a49, Semesterapparat Wagner)
  
  
• [CLR90] T.H. Cormen, C.E. Leiserson, R.L. Rivest: Introduction to Algorithms.
  MIT Press and McGraw-Hill, 1990. (lbs 830/c67(20), kid 112/c67, Semesterapparat Wagner)
  
  
• [Ed96] S. Edelkamp: Weak-Heapsort, ein schnelles Sortierverfahren.
  Diplomarbeit, Computer Science Department, University of Dortmund, 1996. (weakheap.ps.gz)
  
  
• [LW98] A. Liebers, D. Wagner: Grundlagen: Begriffe zu Graphen. ( «graphen.ps», nur lokal verfügbar)
  
  
• [Me84] K. Mehlhorn: Data Structures and Algorithms 1: Sorting and Searching.
  EATCS Monographs on Theoretical Computer Science, Springer-Verlag, 1984. (lbs 830/m24)
  
  
• [OW93] T. Ottmann, P. Widmayer: Algorithmen und Datenstrukturen.
  BI-Wiss.-Verl., 1990. (lbs 830/o99, kid 112/o98, Semesterapparat Wagner)