首页 | 本学科首页   官方微博 | 高级检索  
     


Efficient parallel algorithms for path problems in directed graphs
Authors:Joan M Lucas and Marian Gunsher Sackrowitz
Affiliation:(1) Department of Computer Science, Hill Center, Rutgers University, 08903 New Brunswick, NJ, USA
Abstract:In this paper we describe a technique for finding efficient parallel algorithms for problems on directed graphs that involve checking the existence of certain kinds of paths in the graph. This technique provides efficient algorithms for finding dominators in flow graphs, performing interval and loop analysis on reducible flow graphs, and finding the feedback vertices of a digraph. Each of these algorithms takesO(log2 n) time using the same number of processors needed for fast matrix multiplication. All of these bounds are for an EREW PRAM.
Keywords:Dominators  Parallel algorithms
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号