Algorithmic Paradigms

  • Kurt Mehlhorn
Part of the EATCS Monographs on Theoretical Computer Science book series (EATCS, volume 3)


There are basically two ways for structuring a book on data structures and algorithms: problem or paradigm oriented. We have mostly followed the first alternative because it allows for a more concise treatment. However, at certain occassions (e.g. section VIII.4 on the sweep paradigm in computational geometry) we have also followed the second approach. In this last chapter of the book we attempt to review the entire book from the paradigm oriented point of view.


Planar Graph Problem Instance Cost Path Balance Tree Range Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Kurt Mehlhorn
    • 1
  1. 1.FB 10, Angewandte Mathematik und InformatikUniversität des SaarlandesSaarbrückenGermany

Personalised recommendations