- dominator algorithm
- мат. алгоритм доминирования
Большой англо-русский и русско-английский словарь. 2001.
dominator algorithm
Смотреть что такое "dominator algorithm" в других словарях:
Dominator (graph theory) — For Dominating set problem, see Dominating set. In computer science, in control flow graphs, a node d dominates a node n if every path from the start node to n must go through d. Notationally, this is written as d dom n (or sometimes d n). By… … Wikipedia
Dominating set — For Dominator in control flow graphs, see Dominator (graph theory). Dominating sets (red vertices). In graph theory, a dominating set for a graph G = (V, E) is a subset D of V such that every vertex not in D is joined to at… … Wikipedia
Static single assignment form — In compiler design, static single assignment form (often abbreviated as SSA form or SSA) is an intermediate representation (IR) in which every variable is assigned exactly once. Existing variables in the original IR are split into versions , new… … Wikipedia
Control flow graph — Simplified control flowgraphs[1] A control flow graph (CFG) in computer science is a representation, using graph notation, of all paths that might be traversed through a program during its execution … Wikipedia
Terence McKenna — Terence Kemp McKenna (November 16 1946 – April 3 2000) was a writer, philosopher, and ethnobotanist. He was noted for his many speculations on the use of psychedelic, plant based hallucinogens, and subjects ranging from shamanism, the development … Wikipedia
Граф потока управления — Простые графы потока управления[1] Граф потока управления (англ. … Википедия
