Ulrich Elsner <elsner @ mathematik . tu-chemnitz . de> (email mangled to prevent spamming)
Fakultät für Mathematik TU Chemnitz 90107 Chemnitz Germany
Abstract:
This bibliography concerns itself mainly with algorithms that try achieve fast, high quality partitions. In this respect I hope this collection is rather complete. Other aspects of graph partitions, like theoretical paper, algorithms that concentrate on very high quality partitions with little respect to time (like simulated annealing type algorithms) or very fast algorithms with little regard to quality (graph growing, geometric algorithms) do appear in this collection but in these areas it is by no means complete.
