Constant-time algorithms for minimum spanning tree and related problems on processor array with reconfigurable bus systems

Tien Tai Pan, Shun Shii Lin

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

A processor array with a reconfigurable bus system is a parallel computation model that consists of a processor array and a reconfigurable bus system. In this paper, a constant-time algorithm is proposed on this model for finding the cycles in an undirected graph. We can use this algorithm to decide whether a specified edge belongs to the minimum spanning tree of the graph or not. This cycle-finding algorithm is designed on a two-dimensional n × n processor array with a reconfigurable bus system, where n is the number of vertices in the graph. Based on this cycle-finding algorithm, the minimum spanning tree problem and the spanning tree problem can be solved in O(1) time by using fewer processors than before, O(n × m × n) and O(n3) processors respectively. This is a substantial improvement over previous known results. Moreover, we also propose two constant-time algorithms for solving the minimum spanning tree verification problem and spanning tree verification problem by using O(n3) and O(n2) processors, respectively.

Original languageEnglish
Pages (from-to)174-186
Number of pages13
JournalComputer Journal
Volume45
Issue number2
DOIs
Publication statusPublished - 2002 May 2

    Fingerprint

ASJC Scopus subject areas

  • Computer Science(all)

Cite this