컨텐츠로 이동
A Fast Algorithm for finding Dominators in a Flow Graph. 해당 항목을 미리보기
닫기해당 항목을 미리보기
확인중입니다…

A Fast Algorithm for finding Dominators in a Flow Graph.

저자: Thomas Lengauer; Robert Endre Tarjan; STANFORD UNIV CALIF Dept. of COMPUTER SCIENCE.
출판사: Ft. Belvoir Defense Technical Information Center MAR 1978.
판/형식:   Print book : 영어모든 판과 형식 보기
데이터베이스:WorldCat
요약:
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,  더 읽기…
평가:

(아무런 평가가 없습니다.) 0 리뷰와 함께 - 첫번째로 올려주세요.

주제
다음과 같습니다:

 

도서관에서 사본 찾기

&AllPage.SpinnerRetrieving; 해당항목을 보유하고 있는 도서관을 찾는 중

상세정보

문서 형식:
모든 저자 / 참여자: Thomas Lengauer; Robert Endre Tarjan; STANFORD UNIV CALIF Dept. of COMPUTER SCIENCE.
OCLC 번호: 227494654
설명: 42 pages

초록:

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.

리뷰

사용자-기여 리뷰
GoodReads 리뷰 가져오는 중…
DOGObooks 리뷰를 가지고 오는 중…

태그

첫번째 되기
요청하신 것을 확인하기

이 항목을 이미 요청하셨을 수도 있습니다. 만약 이 요청을 계속해서 진행하시려면 Ok을 선택하세요.

링크된 데이터


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

윈도우 닫기

WorldCat에 로그인 하십시오 

계정이 없으세요? 아주 간단한 절차를 통하여 무료 계정을 만드실 수 있습니다.