PARALLEL MATRIX AND GRAPH ALGORITHMS.

Eliezer Dekel, David Nassimi, Sartaj Sahni

Research output: Contribution to conferencePaperpeer-review

2 Scopus citations

Abstract

Matrix multiplication algorithms for cube connected and perfect shuffle computers are presented. It is shown that many graph problems can be solved efficiently using the matrix multiplication algorithms.

Original languageEnglish (US)
Pages27-36
Number of pages10
StatePublished - Jan 1 1979
Externally publishedYes
EventProc Annu Allerton Conf Commun Control Comput 17th - Monticello, IL, USA
Duration: Oct 10 1979Oct 12 1979

Conference

ConferenceProc Annu Allerton Conf Commun Control Comput 17th
CityMonticello, IL, USA
Period10/10/7910/12/79

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Cite this