Abstract

This EPSRC funded project focuses on the development of new algorithms for graph partitioning (e.g., for dynamic graphs and for graphs with vertex and edge weight) and on the development of a library of graph partitioning algorithms based on graph separators. In comparison with the existing such packages, our algorithms will produce partitions that have guaranteed worst case bounds both on the time and the quality of the partition.