Explore the latest books of this year!
Bookbot

Rolf H. Möhring

    Baustoffkunde für Studium und Praxis
    Graph theoretic concepts in computer science
    Algorithms
    • Algorithms

      • 917 pages
      • 33 hours of reading

      This volume contains the 74 contributed papers and abstracts of 4 of the 5 invited talks presented at the 10th Annual European Symposium on Algorithms (ESA 2002), held at the University of Rome “La Sapienza”, Rome, Italy, 17-21 September, 2002. For the ?rst time, ESA had two tracks, with separate program committees, which dealt respectively – the design and mathematical analysis of algorithms (the “Design and An- ysis” track); – real-world applications, engineering and experimental analysis of algorithms (the “Engineering and Applications” track). Previous ESAs were held in Bad Honnef, Germany (1993); Utrecht, The Neth- lands (1994); Corfu, Greece (1995); Barcelona, Spain (1996); Graz, Austria (1997); Venice, Italy (1998); Prague, Czech Republic (1999); Saarbruc ¨ ken, Ger- ? many (2000), and Arhus, Denmark (2001). The predecessor to the Engineering and Applications track of ESA was the Annual Workshop on Algorithm En- neering (WAE). Previous WAEs were held in Venice, Italy (1997), Saarbruc ¨ ken, ? Germany (1998), London, UK (1999), Saarbru ¨cken, Germany (2000), and Arhus, Denmark (2001). The proceedings of the previous ESAs were published as Springer LNCS volumes 726, 855, 979, 1284, 1461, 1643, 1879, and 2161. The proceedings of WAEs from 1999 onwards were published as Springer LNCS volumes 1668, 1982, and 2161.

      Algorithms
    • This book constitutes the strictly refereed post-workshop proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science, WG'97, held in Berlin, Germany in June 1997. The volume presents 28 revised full papers carefully selected for inclusion in the book from 42 submissions. The papers address a variety of graph-theoretic issues relevant from the computer science point of view such as graph algorithms, cycles, graph decompositions, interconnection networks, local search, graph orderings, graph matching, graph languages, tree-width computation, etc.

      Graph theoretic concepts in computer science