doorgaan naar inhoud
A Fast Algorithm for finding Dominators in a Flow Graph. Voorbeeldweergave van dit item
SluitenVoorbeeldweergave van dit item
Bezig met controle...

A Fast Algorithm for finding Dominators in a Flow Graph.

Auteur: Thomas Lengauer; Robert Endre Tarjan; STANFORD UNIV CALIF DEPT OF COMPUTER SCIENCE.
Uitgever: Ft. Belvoir Defense Technical Information Center MAR 1978.
Editie/Formaat:   Boek : EngelsAlle edities en materiaalsoorten bekijken.
Database:WorldCat
Samenvatting:
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,  Meer lezen...
Beoordeling:

(nog niet beoordeeld) 0 met beoordelingen - U bent de eerste

Onderwerpen
Meer in deze trant

 

Zoeken naar een in de bibliotheek beschikbaar exemplaar

&AllPage.SpinnerRetrieving; Bibliotheken met dit item worden gezocht…

Details

Soort document: Boek
Alle auteurs / medewerkers: Thomas Lengauer; Robert Endre Tarjan; STANFORD UNIV CALIF DEPT OF COMPUTER SCIENCE.
OCLC-nummer: 227494654
Beschrijving: 42 p.

Fragment:

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.

Beoordelingen

Beoordelingen door gebruikers
Beoordelingen van GoodReads worden opgehaald...
Bezig met opvragen DOGObooks-reviews...

Tags

U bent de eerste.
Bevestig deze aanvraag

Misschien heeft u dit item reeds aangevraagd. Selecteer a.u.b. Ok als u toch wilt doorgaan met deze aanvraag.

Gekoppelde 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

Venster sluiten

Meld u aan bij WorldCat 

Heeft u geen account? U kunt eenvoudig een nieuwe gratis account aanmaken.