passa ai contenuti
A Fast Algorithm for finding Dominators in a Flow Graph. Anteprima di questo documento
ChiudiAnteprima di questo documento
Stiamo controllando…

A Fast Algorithm for finding Dominators in a Flow Graph.

Autore: Thomas Lengauer; Robert Endre Tarjan; STANFORD UNIV CALIF Dept. of COMPUTER SCIENCE.
Editore: Ft. Belvoir Defense Technical Information Center MAR 1978.
Edizione/Formato:   book_printbook : EnglishVedi tutte le edizioni e i formati
Banca dati:WorldCat
Sommario:
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,  Per saperne di più…
Voto:

(non ancora votato) 0 con commenti - Diventa il primo.

Soggetti
Altri come questo

 

Trova una copia in biblioteca

&AllPage.SpinnerRetrieving; Stiamo ricercando le biblioteche che possiedono questo documento…

Dettagli

Tipo documento: Book
Tutti gli autori / Collaboratori: Thomas Lengauer; Robert Endre Tarjan; STANFORD UNIV CALIF Dept. of COMPUTER SCIENCE.
Numero OCLC: 227494654
Descrizione: 42 pages

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.

Commenti

Commenti degli utenti
Recuperando commenti GoodReads…
Stiamo recuperando commenti DOGObooks

Etichette

Diventa il primo.
Conferma questa richiesta

Potresti aver già richiesto questo documento. Seleziona OK se si vuole procedere comunque con questa richiesta.

Dati collegati


Primary Entity

<http://www.worldcat.org/oclc/227494654> # A Fast Algorithm for finding Dominators in a Flow Graph.
    a schema:CreativeWork, schema:Book ;
   library:oclcnum "227494654" ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/23397965#Place/ft_belvoir> ; # Ft. Belvoir
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/vau> ;
   schema:about <http://experiment.worldcat.org/entity/work/data/23397965#Topic/algorithms> ; # Algorithms
   schema:about <http://experiment.worldcat.org/entity/work/data/23397965#Topic/theoretical_mathematics> ; # Theoretical Mathematics
   schema:about <http://experiment.worldcat.org/entity/work/data/23397965#Topic/graphs> ; # Graphs
   schema:about <http://experiment.worldcat.org/entity/work/data/23397965#Thing/search_theory> ; # Search theory
   schema:about <http://experiment.worldcat.org/entity/work/data/23397965#Thing/trees_mathematics> ; # Trees(Mathematics)
   schema:about <http://experiment.worldcat.org/entity/work/data/23397965#Topic/searching> ; # Searching
   schema:bookFormat bgn:PrintBook ;
   schema:contributor <http://experiment.worldcat.org/entity/work/data/23397965#Person/lengauer_thomas> ; # Thomas Lengauer
   schema:contributor <http://experiment.worldcat.org/entity/work/data/23397965#Organization/stanford_univ_calif_dept_of_computer_science> ; # STANFORD UNIV CALIF Dept. of COMPUTER SCIENCE.
   schema:contributor <http://experiment.worldcat.org/entity/work/data/23397965#Person/tarjan_robert_endre> ; # Robert Endre Tarjan
   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:productID "227494654" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/227494654#PublicationEvent/ft_belvoirdefense_technical_information_centermar_1978> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/23397965#Agent/defense_technical_information_center> ; # Defense Technical Information Center
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/227494654> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/23397965#Agent/defense_technical_information_center> # Defense Technical Information Center
    a bgn:Agent ;
   schema:name "Defense Technical Information Center" ;
    .

<http://experiment.worldcat.org/entity/work/data/23397965#Organization/stanford_univ_calif_dept_of_computer_science> # STANFORD UNIV CALIF Dept. of COMPUTER SCIENCE.
    a schema:Organization ;
   schema:name "STANFORD UNIV CALIF Dept. of COMPUTER SCIENCE." ;
    .

<http://experiment.worldcat.org/entity/work/data/23397965#Person/lengauer_thomas> # Thomas Lengauer
    a schema:Person ;
   schema:familyName "Lengauer" ;
   schema:givenName "Thomas" ;
   schema:name "Thomas Lengauer" ;
    .

<http://experiment.worldcat.org/entity/work/data/23397965#Person/tarjan_robert_endre> # Robert Endre Tarjan
    a schema:Person ;
   schema:familyName "Tarjan" ;
   schema:givenName "Robert Endre" ;
   schema:name "Robert Endre Tarjan" ;
    .

<http://experiment.worldcat.org/entity/work/data/23397965#Thing/trees_mathematics> # Trees(Mathematics)
    a schema:Thing ;
   schema:name "Trees(Mathematics)" ;
    .

<http://experiment.worldcat.org/entity/work/data/23397965#Topic/theoretical_mathematics> # Theoretical Mathematics
    a schema:Intangible ;
   schema:name "Theoretical Mathematics"@en ;
    .


Content-negotiable representations

Chiudi finestra

Per favore entra in WorldCat 

Non hai un account? Puoi facilmente crearne uno gratuito.