Ja-be-ja: a distributed algorithm for balanced graph partitioning

Rahimian Fatemeh, Payberah Amir H., Girdzijauskas Sarunas, Jelasity Márk, Harid Seif: Ja-be-ja: a distributed algorithm for balanced graph partitioning.
In: Seventh IEEE International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2013). Philadelphia, Amerikai Egyesült Államok, 2013.09.09-2013.09.13. IEEE Computer Society, Los Alamitos, pp. 51-60. (2013) ISBN 978-0-7695-5129-6

This is the latest version of this item.

[img]
Preview
Text
saso13.pdf - Accepted Version

Download (299kB) | Preview
Item Type: Book Section
Date: 2013
Page Range: pp. 51-60
ISBN: 978-0-7695-5129-6
Publisher: IEEE Computer Society
Place of Publication: Los Alamitos
Faculty: Faculty of Science and Informatics
Department: MTA-SZTE Mesterséges Intelligencia Kutatócsoport
Institution: Szegedi Tudományegyetem
Identification Number: 2398231
DOI id: https://doi.org/10.1109/SASO.2013.13
Date Deposited: 2013. Sep. 16. 09:05
Last Modified: 2018. Jul. 31. 15:25
URI: http://publicatio.bibl.u-szeged.hu/id/eprint/3304

Available Versions of this Item

  • Ja-be-ja: a distributed algorithm for balanced graph partitioning. (2013. Sep. 16. 09:05) [Currently Displayed]

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year