An 0(log n) parallel algorithm for strong connectivity augmentation problem

DOI10.1080/00207168708803592zbMath0656.68071OpenAlexW2057226617WikidataQ126244642 ScholiaQ126244642MaRDI QIDQ3804208

Pranay Chaudhuri

Publication date: 1987

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168708803592

zbMATH Keywords

augmentationparallel algorithmtime complexitystrong connectivityCRCW PRAMparallel random access machine

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Theory of operating systems (68N25)

Related Items (3)

Fast parallel graph searching with applications ⋮ FINDING CENTERS AND MEDIANS OF GRAPHS IN PARALLEL ⋮ An adaptive parallel algorithm for analyzing activity networks

Cites Work

• Unnamed Item
• Depth-first search is inherently sequential
• Parallel computation and conflicts in memory access
• Finding the maximum, merging, and sorting in a parallel computation model
• Augmentation Problems
• Parallel Computations in Graph Theory
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: An 0(log n) parallel algorithm for strong connectivity augmentation problem