Abstract
In this paper we study graph partitioning which is an important NP-complete problem. We have implemented two mob heuristics and analysed their performance. Our main result is that for randomly generated graphs the mob heuristics with an exponential schedule is more efficient than that with the linear schedule, proposed earlier. With the other parameters of the heuristic being identical the exponential schedule doubles the speedup.
This work was supported by CTU under Grant 3097477/336.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco, 1979.
D. S. Johnson, C. H. Papadimitriou, and H. Yannakakis. How easy is local search? J. Comput. System Sci., 37:79–100, 1988.
B. W. Kernighan and S. Lin. An effecient heuristic procedure for partitioning graphs. AT & T Bell Labs. Tech. J., 49:291–307, 1970.
S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi. Optimization by simulated annealing. Science, 220:671–680, 1983.
J. E. Savage and M. G. Wloka. Parallelism in graph-partitioning. Journal of Parallel and Distributed Computing, 13:257–272, 1991.
M. Šoch, J. Trdlička, and P. Tvrdć. PVM, computational geometry, and parallel computing course. In A. Bode, J. Dongarra, T. Ludwig, and V. Sunderam, editors, Parallel Virtual Machine — EuroPVM'96, number 1156 in Lecture Notes of Computer Science, pages 38–44. Springer Verlag, 1996.
Author information
Authors and Affiliations
Corresponding author
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Šoch, M., Tvrdík, P., Volf, M. (1997). Parallel graph-partitioning using the mob heuristic. In: Bubak, M., Dongarra, J., Waśniewski, J. (eds) Recent Advances in Parallel Virtual Machine and Message Passing Interface. EuroPVM/MPI 1997. Lecture Notes in Computer Science, vol 1332. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63697-8_108
Download citation
DOI: https://doi.org/10.1007/3-540-63697-8_108
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63697-7
Online ISBN: 978-3-540-69629-2
eBook Packages: Springer Book Archive