Skip to main navigation Skip to search Skip to main content

Divide-and-Conquer-Based Optimal Parallel Algorithms for Some Graph Problems on EREW PRAM Model

  • Department of Computer Science, University of Central Florida

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

Original languageEnglish
Pages (from-to)312-322
Number of pages11
JournalIEEE Transactions on Circuits and Systems
Volume35
Issue number3
DOIs
StatePublished - Mar 1988
Externally publishedYes

ASJC Scopus Subject Areas

  • General Engineering

Keywords

  • bipartite
  • bridges
  • connected components
  • EREW PRAM
  • fundamental cycles
  • graph problems
  • optimal algorithms
  • parallel algorithms
  • spanning forest

Fingerprint

Dive into the research topics of 'Divide-and-Conquer-Based Optimal Parallel Algorithms for Some Graph Problems on EREW PRAM Model'. Together they form a unique fingerprint.

Cite this