An adaptive parallel algorithm for analyzing activity networks

DOI10.1016/0167-6377(90)90037-6MaRDI QIDQ910339zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 3561035 (Why is no real title available?)
• scientific article; zbMATH DE number 3446921 (Why is no real title available?)
• A note on two problems in connexion with graphs
• An 0(log n) parallel algorithm for strong connectivity augmentation problem
• An adaptive and cost-optimal parallel algorithm for minimum spanning trees
• Fast parallel graph searching with applications
• Parallel Matrix and Graph Algorithms
• Prallel algorithms for analyzing activity networks

Cited in

(3)

• PARALLEL INCREMENTAL ALGORITHMS FOR ANALYZING ACTIVITY NETWORKS
• Prallel algorithms for analyzing activity networks
• scientific article; zbMATH DE number 4178740 (Why is no real title available?)

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)