Node listings for reducible flow graphs

DOI10.1016/S0022-0000(76)80042-6zbMath0354.68077MaRDI QIDQ1236887

A. V. Aho, Jeffrey D. Ullman

Publication date: 1976

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Related Items (3)

Min (a)cyclic feedback vertex sets and MIN ones monotone 3-SAT ⋮ Finding the depth of a flow graph ⋮ A region analysis algorithm for the live variables problem

Cites Work

• Testing flow graph reducibility
• Fast algorithms for the elimination of common subexpressions
• Characterizations of Reducible Flow Graphs
• Global Data Flow Analysis and Iterative Algorithms
• A Fast and Usually Linear Algorithm for Global Flow Analysis
• A Simple Algorithm for Global Data Flow Analysis Problems
• An empirical study of FORTRAN programs
• A global flow analysis algorithm
• Flow Graph Reducibility
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Node listings for reducible flow graphs