Skip to main navigation Skip to search Skip to main content

Two minimum spanning forest algorithms on fixed-size hypercube computers

  • University of North Texas
  • Department of Computer Science, University of Central Florida

Research output: Contribution to journal › Article › peer-review

Original languageEnglish
Pages (from-to)179-187
Number of pages9
JournalParallel Computing
Volume15
Issue number1-3
DOIs
StatePublished - Sep 1990
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

  • Graph problems
  • Hypercube computers
  • Minimum spanning forest
  • Parallel algorithms

Fingerprint

Dive into the research topics of 'Two minimum spanning forest algorithms on fixed-size hypercube computers'. Together they form a unique fingerprint.

Cite this