Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard ∗ James Demmel †

First Page		Document Content
Date: 2014-11-26 08:32:33 Graph theory Mathematics Combinatorial optimization Edsger W. Dijkstra Matrix multiplication algorithm NP-complete problems Matching Routing algorithms Computational complexity theory Connected component Dynamic programming Graph coloring		Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard ∗ James Demmel † Add to Reading List Source URL: www.cs.huji.ac.il Download Document from Source Website File Size: 381,17 KB Share Document on Facebook

	Theory and Techniques for Synthesizing a Family of Graph Algorithms Srinivas Nedunuri William R. Cook DocID: 1xVkB - View Document
	PDF Document DocID: 1xkJU - View Document
	Graph theory Po-Shen Loh June DocID: 1vmTo - View Document
	Graph theory Po-Shen Loh June DocID: 1vhpu - View Document
	Graph theory Po-Shen Loh June DocID: 1v8nl - View Document