Maria Predari, Aurélien Esnard. A k-Way Greedy Graph Partitioning with Initial Fixed Vertices for Parallel Applications. In 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, PDP 2016, Heraklion, Crete, Greece, February 17-19, 2016. pages 280-287, IEEE, 2016. [doi]
@inproceedings{PredariE16,
title = {A k-Way Greedy Graph Partitioning with Initial Fixed Vertices for Parallel Applications},
author = {Maria Predari and Aurélien Esnard},
year = {2016},
doi = {10.1109/PDP.2016.109},
url = {http://doi.ieeecomputersociety.org/10.1109/PDP.2016.109},
researchr = {https://researchr.org/publication/PredariE16},
cites = {0},
citedby = {0},
pages = {280-287},
booktitle = {24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, PDP 2016, Heraklion, Crete, Greece, February 17-19, 2016},
publisher = {IEEE},
isbn = {978-1-4673-8776-7},
}