Prallel algorithms for analyzing activity networks

DOI10.1007/BF01935049zbMath0621.68043OpenAlexW1982293342MaRDI QIDQ1090459

Pranay Chaudhuri, Ratan K. Ghosh

Publication date: 1986

Published in: BIT (Search for Journal in Brave)

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

zbMATH Keywords

digraphParallel algorithmsweighted graphactivity networkstime complexitytopological orderCRCW PRAMcritical activity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Related Items (6)

NC algorithms for dynamically solving the all pairs shortest paths problem and related problems ⋮ Fast parallel graph searching with applications ⋮ On the Parallel Evaluation of Dwba Integrals ⋮ An adaptive parallel algorithm for analyzing activity networks ⋮ Reducing conflict resolution time for solving graph problems in broadcast communications ⋮ Parallel algorithm for analysing activity networks on a tree-structured computer

Cites Work

• A parallel search algorithm for directed acyclic graphs
• Graph algorithms on a tree-structured parallel computer
• Routing, merging, and sorting on parallel models of computation
• Parallel algorithms for the single source shortest path problem
• An Efficient Parallel Biconnectivity Algorithm
• Graph Problems on a Mesh-Connected Processor Array
• Finding the maximum, merging, and sorting in a parallel computation model
• Parallel Matrix and Graph Algorithms
• Unnamed Item
• Unnamed Item

This page was built for publication: Prallel algorithms for analyzing activity networks