Graph algorithms on a tree-structured parallel computer

DOI10.1007/BF02136031MaRDI QIDQ797290zbMATHOpenAlexFDO

Authors 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

minimum spanning treegraph algorithmtransitive closureconnected componentstime complexityParallel algorithmsSIMD computersystolic computertree-structured computer

Mathematics Subject Classification ID

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

Recommendations

• Finding fundamental cycles and bridges on a tree-structured parallel computer
• scientific article; zbMATH DE number 1186513
• scientific article; zbMATH DE number 4068310
• A Parallel Algorithm for Computing Minimum Spanning Trees
• scientific article; zbMATH DE number 4033068

Cites work

• scientific article; zbMATH DE number 3573250 (Why is no real title available?)
• A parallel algorithm for constructing minimum spanning trees
• Computing connected components on parallel computers
• Efficient parallel algorithms for some graph problems
• Fast, Efficient Parallel Algorithms for Some Graph Problems
• Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer
• New Algorithms and Lower Bounds for the Parallel Evaluation of Certain Rational Expressions and Recurrences
• Parallel Matrix and Graph Algorithms
• Parallel algorithms for the connected components and minimal spanning tree problems

Cited in

(18)

• Binary tree algebraic computation and parallel algorithms for simple graphs
• scientific article; zbMATH DE number 1186513 (Why is no real title available?)
• Parallel graph algorithms for hypercube computers
• Parallel algorithm for analysing activity networks on a tree-structured computer
• Equivalence in the complexity of several problems
• scientific article; zbMATH DE number 4094808 (Why is no real title available?)
• Stirling networks: A versatile combinatorial topology for multiprocessor systems
• scientific article; zbMATH DE number 4133492 (Why is no real title available?)
• Finding fundamental cycles and bridges on a tree-structured parallel computer
• scientific article; zbMATH DE number 4026840 (Why is no real title available?)
• scientific article; zbMATH DE number 1985710 (Why is no real title available?)
• A simple parallel tree contraction algorithm
• Parallel Algorithm for Conflict Graph on OTIS-Triangular Array
• Prallel algorithms for analyzing activity networks
• scientific article; zbMATH DE number 4035123 (Why is no real title available?)
• Euro-Par 2004 Parallel Processing
• Parallel computations on a graph
• scientific article; zbMATH DE number 3974298 (Why is no real title available?)

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

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