A strong-connectivity algorithm and its applications in data flow analysis

Research output: Contribution to journalArticlepeer-review

Abstract

We present a new linear algorithm for constructing all strongly connected components of a directed graph, and show how to apply it in iterative solution of data-flow analysis problems, to obtain a simple algorithm which improves the Hecht-Ullman algorithm.

Original languageEnglish
Pages (from-to)67-72
Number of pages6
JournalComputers and Mathematics with Applications
Volume7
Issue number1
DOIs
StatePublished - 1981
Externally publishedYes

Fingerprint

Dive into the research topics of 'A strong-connectivity algorithm and its applications in data flow analysis'. Together they form a unique fingerprint.

Cite this