An adaptive parallel algorithm for analyzing activity networks

DOI10.1016/0167-6377(90)90037-6zbMath0695.90094OpenAlexW1966097129MaRDI QIDQ910339

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

weighted graphparallel algorithmPERTactivity 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
• An adaptive and cost-optimal parallel algorithm for minimum spanning trees
• Prallel algorithms for analyzing activity networks
• Fast parallel graph searching with applications
• An 0(log n) parallel algorithm for strong connectivity augmentation problem
• Parallel Matrix and Graph Algorithms
• Unnamed Item
• Unnamed Item

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