Back to Results
First PageMeta Content
Graph theory / Mathematics / NP-complete problems / Graph partition / Hypergraph / Graph traversal / Breadth-first search / Vertex / Graph / Shortest path problem / Ear decomposition / HopcroftKarp algorithm


Contemporary Mathematics Graph Partitioning for Scalable Distributed Graph Computations Aydın Bulu¸c and Kamesh Madduri Abstract. Inter-node communication time constitutes a significant fraction
Add to Reading List

Document Date: 2013-03-15 01:10:50


Open Document

File Size: 2,06 MB

Share Result on Facebook