Optimal component labeling algorithms for mesh-connected computers and VLSI release_3jpjr4d6ovhrheyzhwlonl3t6u

by Quentin F. Stout

Released as a article .

2015  

Abstract

Given an undirected graph G of n weighted edges, stored one edge per processor in a square mesh of n processors, we show how to determine the connected components and a minimal spanning forest in Θ(√(n)) time. More generally, we show how to solve these problems in Θ(n^1/d) time when the mesh is a d-dimensional cube, where the implied constants depend upon d.
In text/plain format

Archived Files and Locations

application/pdf  264.3 kB
file_4hynzfzpm5hgjf6htt72yrulha
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2015-02-05
Version   v1
Language   en ?
arXiv  1502.01435v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 2cbf8034-b6a0-4524-92c0-3fcacd644b55
API URL: JSON