Two minimum spanning forest algorithms on fixed-size hypercube computers

DOI10.1016/0167-8191(90)90041-7MaRDI QIDQ916371zbMATH OpenOpenAlexFDO

Authors Sajal K. Das, Narsingh Deo, Sushil K. Prasad

Publication date 1990

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(90)90041-7

zbMATH Keywords

parallel algorithmsgraph problemsminimum spanning foresthypercube computers

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• Parallel graph algorithms for hypercube computers
• Computing minimum spanning forests on 1- and 2-dimensional processor arrays (extended abstract)
• A Parallel Algorithm for Computing Minimum Spanning Trees
• A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest
• Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs

Cited in

(10)

• scientific article; zbMATH DE number 1419215 (Why is no real title available?)
• Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
• Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs
• scientific article; zbMATH DE number 1556480 (Why is no real title available?)
• Parallel graph algorithms for hypercube computers
• Broadcasting spanning forests on a multiple-access channel
• Computing minimum spanning forests on 1- and 2-dimensional processor arrays (extended abstract)
• A distributed algorithmic framework for coverage problems in wireless sensor networks
• scientific article; zbMATH DE number 3980506 (Why is no real title available?)
• Stirling networks: A versatile combinatorial topology for multiprocessor systems

This page was built for publication: Two minimum spanning forest algorithms on fixed-size hypercube computers

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