Two minimum spanning forest algorithms on fixed-size hypercube computers

DOI10.1016/0167-8191(90)90041-7zbMath0703.68049OpenAlexW2062851100MaRDI QIDQ916371

Narsingh Deo, Sajal K. Das, 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)

Related Items (2)

Stirling networks: A versatile combinatorial topology for multiprocessor systems ⋮ A distributed algorithmic framework for coverage problems in wireless sensor networks

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