Graph algorithms on a tree-structured parallel computer

DOI10.1007/BF02136031zbMath0545.68061OpenAlexW2050278180MaRDI QIDQ797290

N. E. Zubov

Publication date: 1984

Published in: BIT (Search for Journal in Brave)

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

zbMATH Keywords

connected componentsgraph algorithmParallel algorithmstime complexitytransitive closureminimum spanning treeSIMD computersystolic computertree-structured computer

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

Prallel algorithms for analyzing activity networks ⋮ Finding fundamental cycles and bridges on a tree-structured parallel computer ⋮ Stirling networks: A versatile combinatorial topology for multiprocessor systems ⋮ Parallel algorithm for analysing activity networks on a tree-structured computer

Cites Work

• Unnamed Item
• Parallel algorithms for the connected components and minimal spanning tree problems
• Computing connected components on parallel computers
• A parallel algorithm for constructing minimum spanning trees
• Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer
• Parallel Matrix and Graph Algorithms
• Fast, Efficient Parallel Algorithms for Some Graph Problems
• Efficient parallel algorithms for some graph problems
• New Algorithms and Lower Bounds for the Parallel Evaluation of Certain Rational Expressions and Recurrences

This page was built for publication: Graph algorithms on a tree-structured parallel computer