A k-Way Greedy Graph Partitioning with Initial Fixed Vertices for Parallel Applications

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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.