aller au contenu
A Fast Algorithm for finding Dominators in a Flow Graph. Aperçu de cet ouvrage
FermerAperçu de cet ouvrage
Vérifiant…

A Fast Algorithm for finding Dominators in a Flow Graph.

Auteur : Thomas Lengauer; Robert Endre Tarjan; STANFORD UNIV CALIF Dept. of COMPUTER SCIENCE.
Éditeur : Ft. Belvoir Defense Technical Information Center MAR 1978.
Édition/format :   Print book : AnglaisVoir toutes les éditions et tous les formats
Base de données :WorldCat
Résumé :
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,  Lire la suite...
Évaluation :

(pas encore évalué) 0 avec des critiques - Soyez le premier.

Sujets
Plus comme ceci

 

Trouver un exemplaire dans la bibliothèque

&AllPage.SpinnerRetrieving; Recherche de bibliothèques qui possèdent cet ouvrage...

Détails

Format : Livre
Tous les auteurs / collaborateurs : Thomas Lengauer; Robert Endre Tarjan; STANFORD UNIV CALIF Dept. of COMPUTER SCIENCE.
Numéro OCLC : 227494654
Description : 42 pages

Résumé :

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.

Critiques

Critiques d’utilisateurs
Récupération des critiques de GoodReads...
Récuperation des critiques DOGObooks…

Tags

Soyez le premier.
Confirmez cette demande

Vous avez peut-être déjà demandé cet ouvrage. Veuillez sélectionner OK si vous voulez poursuivre avec cette demande quand même.

Données liées


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#Organization/stanford_univ_calif_dept_of_computer_science> ; # STANFORD UNIV CALIF Dept. of COMPUTER SCIENCE.
    schema:contributor <http://viaf.org/viaf/73933029> ; # Robert Endre Tarjan
    schema:contributor <http://viaf.org/viaf/266353543> ; # Thomas Lengauer
    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#Thing/search_theory> # Search theory
    a schema:Thing ;
    schema:name "Search theory" ;
    .

<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 ;
    .

<http://viaf.org/viaf/266353543> # Thomas Lengauer
    a schema:Person ;
    schema:familyName "Lengauer" ;
    schema:givenName "Thomas" ;
    schema:name "Thomas Lengauer" ;
    .

<http://viaf.org/viaf/73933029> # Robert Endre Tarjan
    a schema:Person ;
    schema:familyName "Tarjan" ;
    schema:givenName "Robert Endre" ;
    schema:name "Robert Endre Tarjan" ;
    .


Content-negotiable representations

Fermer la fenêtre

Veuillez vous identifier dans WorldCat 

Vous n’avez pas de compte? Vous pouvez facilement créer un compte gratuit.