| Related articles |
|---|
| finding all dominator trees amichail@gmail.com (Amir Michail) (2006-11-22) |
| Re: finding all dominator trees diablovision@yahoo.com (2006-11-26) |
| Re: finding all dominator trees martin@gkc.org.uk (Martin Ward) (2006-11-27) |
| Re: finding all dominator trees amichail@gmail.com (Amir Michail) (2006-11-27) |
| Re: finding all dominator trees s1l3ntR3p@gmail.com (s1l3ntr3p) (2006-11-28) |
| Re: finding all dominator trees amichail@gmail.com (Amir Michail) (2006-11-29) |
| Re: finding all dominator trees bmoses-nospam@cits1.stanford.edu (Brooks Moses) (2006-11-29) |
| [10 later articles] |
| From: | "Amir Michail" <amichail@gmail.com> |
| Newsgroups: | comp.compilers |
| Date: | 22 Nov 2006 21:18:11 -0500 |
| Organization: | Compilers Central |
| Keywords: | optimize, question |
| Posted-Date: | 22 Nov 2006 21:18:11 EST |
Hi,
Is there an efficient algorithm for finding all dominator trees of a
graph? That is, for every node, find its dominator tree. I'm looking
for something better than simply running a dominator tree algorithm for
each node in the graph.
Amir
Return to the
comp.compilers page.
Search the
comp.compilers archives again.