Dominators in Linear Time
نویسندگان
چکیده
A linear time algorithm is presented for nding dominators in control ow graphs.
منابع مشابه
Immediate Dominators in Linear Time An Elegant and Non-Amortized Algorithm EXTENDED ABSTRACT
Immediate Dominators in Linear Time An Elegant and Non-Amortized Algorithm EXTENDED ABSTRACT
متن کاملA Linear-Time Algorithm for Finding All Double-Vertex Dominators of a Given Vertex
Dominators provide a general mechanism for identifying reconverging paths in graphs. This is useful for a number of applications in ComputerAided Design (CAD) including signal probability computation in biased random simulation, switching activity estimation in power and noise analysis, and cut points identification in equivalence checking. However, traditional single-vertex dominators are too ...
متن کاملFinding Dominators Revisited
The problem of finding dominators in a flowgraph arises in many kinds of global code optimization and other settings. In 1979 Lengauer and Tarjan gave an almost-linear-time algorithm to find dominators. In 1985 Harel claimed a lineartime algorithm, but this algorithm was incomplete; Alstrup et al. [1999] gave a complete and “simpler” linear-time algorithm on a random-access machine. In 1998, Bu...
متن کاملFinding dominators via disjoint set union
The problem of finding dominators in a directed graph has many important applications, notably in global optimization of computer code. Although linear and near-lineartime algorithms exist, they use sophisticated data structures. We develop an algorithm for finding dominators that uses only a “static tree” disjoint set data structure in addition to simple lists and maps. The algorithm runs in n...
متن کاملComputing Frequency Dominators and Related Problems
We consider the problem of finding frequency dominators in a directed graph with a single source vertex and a single terminal vertex. A vertex x is a frequency dominator of a vertex y if and only if in each source to terminal path, the number of occurrences of x is at least equal to the number of occurrences of y. This problem was introduced in a paper by Lee et al. [11] in the context of dynam...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Comput.
دوره 28 شماره
صفحات -
تاریخ انتشار 1999