Loading [a11y]/accessibility-menu.js
Parallel heuristic search in multilevel graph partitioning | IEEE Conference Publication | IEEE Xplore

Parallel heuristic search in multilevel graph partitioning


Abstract:

The graph partitioning problem consists of dividing the vertices of a graph into a set of balanced parts, such that the number of edges connecting vertices in different p...Show More

Abstract:

The graph partitioning problem consists of dividing the vertices of a graph into a set of balanced parts, such that the number of edges connecting vertices in different parts is minimised. The multilevel approaches reduce the size of the graph by successively matching vertices and edges until a small graph is built, which is divided into several parts. Then simultaneous optimisation of the partitions is carried out. The complexity of the scientific applications where the graph partitioning problem appears, makes parallel processing very useful. We present a new parallel multilevel algorithm for graph partitioning, which is focused to explore different areas of the search space. This algorithm mixes heuristic techniques such as simulated annealing (SA), Tabu search (TS) and elitist mechanisms of selection. The partitions obtained by our algorithm often improve the results of the corresponding serial version, and these provided by other previously proposed algorithms.
Date of Conference: 11-13 February 2004
Date Added to IEEE Xplore: 08 March 2004
Print ISBN:0-7695-2083-9
Print ISSN: 1066-6192
Conference Location: Coruna, Spain

Contact IEEE to Subscribe

References

References is not available for this document.