Results 1 
2 of
2
Dominators in Linear Time
, 1997
"... A linear time algorithm is presented for finding dominators in control flow graphs. ..."
Abstract

Cited by 25 (0 self)
 Add to MetaCart
A linear time algorithm is presented for finding dominators in control flow graphs.
Parallel Shortest Path for Arbitrary Graphs
 In EUROPAR: Parallel Processing, 6th International EUROPAR Conference. LNCS
, 2000
"... . In spite of intensive research, no workecient parallel algorithm for the single source shortest path problem is known which works in sublinear time for arbitrary directed graphs with nonnegative edge weights. We present an algorithm that improves this situation for graphs where the ratio dc= ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
. In spite of intensive research, no workecient parallel algorithm for the single source shortest path problem is known which works in sublinear time for arbitrary directed graphs with nonnegative edge weights. We present an algorithm that improves this situation for graphs where the ratio dc= between the maximum weight of a shortest path dc and a \safe step width" is not too large. We show how such a step width can be found eciently and give several graph classes which meet the above condition, such that our parallel shortest path algorithm runs in sublinear time and uses linear work. The new algorithm is even faster than a previous one which only works for random graphs with random edge weights [10]. On those graphs our new approach is faster by a factor of (log n= log log n) and achieves an expected time bound of O(log 2 n) using linear work. 1 Introduction The single source shortest path problem (SSSP) is a fundamental and wellstudied combinatorial optimizati...