Abstract
We present heuristic mesh-partitioning method build on the ant-colony algorithm (ACA) in order to improve the quality of the mesh partitions. The method focuses on improving the initial partition that is submitted to the ACA. The method is experimentally compared with the well-known mesh-partitioning programs pMETIS 4.0 and Chaco 2.0.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Hendrickson, B., Leland, R.: A multilevel algorithm for partitioning graphs. In: Proc. Supercomputing (1985)
Karypis, G., Kumar, V.: Multilevel k-way partioning scheme for irregular graphs. J. Parallel Distr. Com. 48, 96–129 (1998)
Linde, Y., Buzo, A., Gray, R.M.: An algorithm for vector quantizer design. IEEE Trans. Commun. 28, 84–95 (1980)
Meuleau, N., Dorigo, M.: Ant colony optimization and stochastic gradient descent. Artif. Life 8, 103–121 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Šilc, J., Korošec, P., Robič, B. (2004). Combining Vector Quantization and Ant-Colony Algorithm for Mesh-Partitioning. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2003. Lecture Notes in Computer Science, vol 3019. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24669-5_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-24669-5_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21946-0
Online ISBN: 978-3-540-24669-5
eBook Packages: Springer Book Archive