Three simple node list algorithms

Authors:
Henry S. Warren, Jr.
Affiliations:
IBM Thomas J. Watson Research Center, Yorktown Heights, N.Y. 10598, U.S.A.
Venue:
Computer Languages
Year:
1978

Citing 3
Cited 1

Node listings applied to data flow analysis

POPL '75 Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A fast and usually linear algorithm for global flow analysis

POPL '75 Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Node listings for reducible flow graphs

STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing

Generation of node lists using segment analysis

Computer Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

A ''node list'' of a directed graph is a sequence of nodes such that every simple path in the graph is a subsequence of the node list. This paper gives three relatively simple algorithms for computing node lists. Previous results are summarized, and areas for further work are suggested.