Graph algorithms on a tree-structured parallel computer

DOI10.1007/BF02136031zbMATH Open0545.68061OpenAlexW2050278180MaRDI QIDQ797290FDOQ797290

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

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

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)

Cites Work

• Title not available (Why is that?)
• 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
• Parallel algorithms for the connected components and minimal spanning tree problems
• Computing connected components on parallel computers
• 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

Cited In (18)

• Title not available (Why is that?)
• Finding fundamental cycles and bridges on a tree-structured parallel computer
• Equivalence in the complexity of several problems
• Binary tree algebraic computation and parallel algorithms for simple graphs
• Parallel Algorithm for Conflict Graph on OTIS-Triangular Array
• Title not available (Why is that?)
• Parallel computations on a graph
• Parallel graph algorithms for hypercube computers
• A simple parallel tree contraction algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Parallel algorithm for analysing activity networks on a tree-structured computer
• Prallel algorithms for analyzing activity networks
• Euro-Par 2004 Parallel Processing
• Stirling networks: A versatile combinatorial topology for multiprocessor systems
• Title not available (Why is that?)
• Title not available (Why is that?)

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)