An adaptive parallel algorithm for analyzing activity networks

DOI10.1016/0167-6377(90)90037-6zbMATH Open0695.90094OpenAlexW1966097129MaRDI QIDQ910339FDOQ910339

Authors: Pranay Chaudhuri 

Publication date: 1990

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(90)90037-6

Recommendations

• Prallel algorithms for analyzing activity networks
• Parallel algorithm for analysing activity networks on a tree-structured computer
• PARALLEL INCREMENTAL ALGORITHMS FOR ANALYZING ACTIVITY NETWORKS
• A New Approach to the Activity-time Distribution in PERT
• Publication:3201742

zbMATH Keywords

parallel algorithmweighted graphPERTactivity networkcritical activity

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Theory of operating systems (68N25)

Cites Work

• A note on two problems in connexion with graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fast parallel graph searching with applications
• Parallel Matrix and Graph Algorithms
• An adaptive and cost-optimal parallel algorithm for minimum spanning trees
• Prallel algorithms for analyzing activity networks
• An 0(log n) parallel algorithm for strong connectivity augmentation problem

Cited In (3)

• Title not available (Why is that?)
• Prallel algorithms for analyzing activity networks
• PARALLEL INCREMENTAL ALGORITHMS FOR ANALYZING ACTIVITY NETWORKS

This page was built for publication: An adaptive parallel algorithm for analyzing activity networks

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