Basic graph algorithms for depth first search, breadth first search, shortest paths, spanning trees or network flows are well established compenents of every algorithms course and many applications. Theory has produced advanced algorithms for these problems that should theoretically be superior to the simple text book methods. The starting point of this project is to explore the possibility to transform such advanced approaches in to practicable algorithms and implementations. We are particularly interested in algorithms that can exploit parallelism and memory hierarchies.
Here is an excerpt from the project proposal (in German) which contains some more information and pointers to relevant literature.
And here is talk on a similar topic presented at the Dagstuhl-Seminar on Algorithmic Aspects of Large and Complex Networks September 16-21, 2001.
Contact at MPII:
Dr. Ulrich Meyer
Max-Planck-Institut für Informatik
Email: "u" + lastname @ mpi-sb.mpg.de
Phone: ++49 681-9325 125
Fax: ++49 681-9325 199
Contact at Karlsruhe university:
Prof. Dr. Peter Sanders
Fakultaet fuer Informatik
Email: lastname @ iru.uka.de
Phone: ++49 721 608 6580
Fax: ++49 721 608 3088