Efficient minimum spanning tree algorithms on the reconfigurable mesh

DOI10.1007/BF02948795MaRDI QIDQ1975444zbMATH OpenOpenAlexFDO

Authors Yingyu Wan, Yinlong Xu, Xiaodong Gu, Guoliang Chen

Publication date 27 April 2000

Published in Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02948795

zbMATH Keywords

reconfigurable bus systemreconfigurable mesh

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• Fast reoptimization for the minimum spanning tree problem
• A faster distributed protocol for constructing a minimum spanning tree
• A faster distributed protocol for constructing a minimum spanning tree
• Efficient minimum spanning tree construction with Delaynay triangulation
• Incremental network design with minimum spanning trees
• scientific article; zbMATH DE number 2201897
• An I/O efficient algorithm for minimum spanning trees
• A fast algorithm for computing minimum routing cost spanning trees

Cites work

• Constant time sorting on a processor array with a reconfigurable bus system
• Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
• scientific article; zbMATH DE number 107951 (Why is no real title available?)
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Parallel algorithms for the connected components and minimal spanning tree problems
• The power of reconfiguration

Cited in

(3)

• A constant-time channel-assignment algorithm on reconfigurable meshes
• Constant time graph algorithms on the reconfigurable multiple bus machine
• scientific article; zbMATH DE number 1779563 (Why is no real title available?)

This page was built for publication: Efficient minimum spanning tree algorithms on the reconfigurable mesh

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1975444)