Skip to main navigation Skip to search Skip to main content

Performance of parallel spanning tree algorithms on linear arrays of transputers and unix systems

  • University of North Texas

Research output: Contribution to journalArticlepeer-review

Original languageEnglish
Pages (from-to)527-551
Number of pages25
JournalParallel Computing
Volume17
Issue number4-5
DOIs
StatePublished - Jul 1991
Externally publishedYes

ASJC Scopus Subject Areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications
  • Computer Graphics and Computer-Aided Design
  • Artificial Intelligence

Keywords

  • linear array
  • minimum spanning tree
  • parallel graph algorithm
  • performance study
  • spanning tree
  • Transputers

Fingerprint

Dive into the research topics of 'Performance of parallel spanning tree algorithms on linear arrays of transputers and unix systems'. Together they form a unique fingerprint.

Cite this