Finding Dominators in Practice

DOI10.7155/jgaa.00119zbMath1161.68039OpenAlexW2111117034MaRDI QIDQ5301382

Renato F. Werneck, Loukas Georgiadis, Robert Endre Tarjan

Publication date: 19 January 2009

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/55392

zbMATH Keywords

dominators in a flowgraphiterative bit-vector algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (8)

Strong articulation points and strong bridges in large scale graphs ⋮ Computing Critical Nodes in Directed Graphs ⋮ Finding dominators via disjoint set union ⋮ Efficient computation of arbitrary control dependencies ⋮ On the dependence of the existence of the positive steady states on the rate coefficients for deficiency-one mass action systems: single linkage class ⋮ Approximating the smallest 2-vertex connected spanning subgraph of a directed graph ⋮ Dynamic Dominators and Low-High Orders in DAGs ⋮ Computing 2-twinless blocks

This page was built for publication: Finding Dominators in Practice