skip to content
A Fast Algorithm for finding Dominators in a Flow Graph. Preview this item
ClosePreview this item
Checking...

A Fast Algorithm for finding Dominators in a Flow Graph.

Author: Thomas Lengauer; Robert Endre Tarjan; STANFORD UNIV CALIF DEPT OF COMPUTER SCIENCE.
Publisher: Ft. Belvoir Defense Technical Information Center MAR 1978.
Edition/Format:   Book : EnglishView all editions and formats
Database:WorldCat
Summary:
This paper presents a fast algorithm for finding dominators in a flow graph. The algorithm uses depth-first search and an efficient method of computing functions defined on paths in trees. A simple implementation of the algorithm runs in O(m log n) time, where m is the number of edges and n is the number of vertices in the problem graph. A sophisticated implementation runs in O(M alpha (m, n)) time, where alpha(m,  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Thomas Lengauer; Robert Endre Tarjan; STANFORD UNIV CALIF DEPT OF COMPUTER SCIENCE.
OCLC Number: 227494654
Description: 42 p.

Abstract:

This paper presents a fast algorithm for finding dominators in a flow graph. The algorithm uses depth-first search and an efficient method of computing functions defined on paths in trees. A simple implementation of the algorithm runs in O(m log n) time, where m is the number of edges and n is the number of vertices in the problem graph. A sophisticated implementation runs in O(M alpha (m, n)) time, where alpha(m, n) is a functional inverse of Ackermann's function. Both versions of the algorithm were implemented in Algol W, and tested on an IBM 370/168. The programs were compared with an implementation by Purdom and Moore of a straightforward O(mn) - time algorithm, and with a bit vector algorithm. The fast algorithm beat the straightforward algorithm and the bit vector algorithm on all but the smallest graphs tests.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/227494654>
library:oclcnum"227494654"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/227494654>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:contributor
schema:contributor
schema:datePublished"1978"
schema:datePublished"MAR 1978"
schema:description"This paper presents a fast algorithm for finding dominators in a flow graph. The algorithm uses depth-first search and an efficient method of computing functions defined on paths in trees. A simple implementation of the algorithm runs in O(m log n) time, where m is the number of edges and n is the number of vertices in the problem graph. A sophisticated implementation runs in O(M alpha (m, n)) time, where alpha(m, n) is a functional inverse of Ackermann's function. Both versions of the algorithm were implemented in Algol W, and tested on an IBM 370/168. The programs were compared with an implementation by Purdom and Moore of a straightforward O(mn) - time algorithm, and with a bit vector algorithm. The fast algorithm beat the straightforward algorithm and the bit vector algorithm on all but the smallest graphs tests."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/23397965>
schema:inLanguage"en"
schema:name"A Fast Algorithm for finding Dominators in a Flow Graph."@en
schema:numberOfPages"42"
schema:publisher
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.