From: Adnan Aziz (adnan_at_ece.utexas.edu)
Date: Mon Jun 27 2005 - 15:39:39 MDT
i think what you are asking for is an algorithm for finding dominators in
a graph, in which case there's a linear time algorithm,
"A linear algorithm for finding dominators in flow graphs and related
problems" STOC 1985, D. Harel. http://portal.acm.org/citation.cfm?id=22166
(See Section 3 - for a logic network you'll have to reverse the sense of
the edges.)
cheers,
adnan
-------------------------------------------
Adnan Aziz, Dept. of Elect. and Comp. Eng.,
The University of Texas, Austin TX, 78712
1 (512) 475-9774 www.ece.utexas.edu/~adnan
-------------------------------------------
On Sat, 25 Jun 2005, Najeeb K wrote:
> Hi All,
>
> I am looking for an efficient graph algo for identifyng all reconvergences
> in the graph. Kindly help me in this regard.
>
> with Thanks
>
>
> Najeeb.k
>
This archive was generated by hypermail 2.1.7 : Mon Jun 27 2005 - 15:43:11 MDT