Generalized dominators for structured programs
From MaRDI portal
Publication:5030185
Recommendations
Cites work
- A fast algorithm for finding dominators in a flowgraph
- A linear time algorithm for finding tree-decompositions of small treewidth
- A Simple Algorithm for Global Data Flow Analysis Problems
- An \(O(| V|^*| E|)\) algorithm for finding immediate multiple-vertex dominators
- Finding Dominators in Directed Graphs
- Generalized dominators
- scientific article; zbMATH DE number 3888887 (Why is no real title available?)
- scientific article; zbMATH DE number 5344975 (Why is no real title available?)
- scientific article; zbMATH DE number 46118 (Why is no real title available?)
- scientific article; zbMATH DE number 1107741 (Why is no real title available?)
- Revised report on the algorithmic language ALGOL 60
- The programming language Pascal
Cited in
(5)
This page was built for publication: Generalized dominators for structured programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5030185)