Efficient parallel algorithms for path problems in directed graphs
From MaRDI portal
Publication:1186791
DOI10.1007/BF01758780zbMath0748.68023MaRDI QIDQ1186791
Joan M. Lucas, Marian Gunsher Sackrowitz
Publication date: 28 June 1992
Published in: Algorithmica (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Finding Euler tours in parallel
- Matrix multiplication via arithmetic progressions
- Depth-first search is inherently sequential
- A linear-time algorithm for a special case of disjoint set union
- Computing dominators in parallel
- An improved parallel algorithm that computes the BFS numbering of a directed graph
- Efficient parallel algorithms for path problems in directed graphs
- Testing flow graph reducibility
- A linear-time algorithm for finding all feedback vertices
- An Efficient Parallel Biconnectivity Algorithm
- A fast algorithm for finding dominators in a flowgraph
- Finding Dominators in Directed Graphs
- Characterizations of Reducible Flow Graphs
- A Fast and Usually Linear Algorithm for Global Flow Analysis
- Transitive compaction in parallel via branchings
This page was built for publication: Efficient parallel algorithms for path problems in directed graphs
