Efficient minimum spanning tree algorithms on the reconfigurable mesh

DOI10.1007/BF02948795zbMath0955.68125OpenAlexW1989165263MaRDI QIDQ1975444

Yingyu Wan, Xiaodong Gu, Yinlong Xu, Guo-Liang 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 meshreconfigurable bus system

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cites Work

• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Constant time sorting on a processor array with a reconfigurable bus system
• Parallel algorithms for the connected components and minimal spanning tree problems
• Efficient Parallel Algorithms for a Class of Graph Theoretic Problems

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