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

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Maria Predari' in GoogleThis author has not been identified. Look up 'Aurélien Esnard' in Google

runs on WebDSL