跳到内容
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.
版本/格式:   图书 : 英语查看所有的版本和格式
数据库: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 p.

摘要:

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的评论

标签

争取是第一个!
确认申请

你可能已经申请过这份资料。如果还是想申请,请选确认。

链接数据


<http://www.worldcat.org/oclc/227494654>
library:oclcnum"227494654"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/227494654>
rdf:typeschema:Book
rdfs:seeAlso
schema:about
schema:about
rdf:typeschema:Intangible
schema:name"Theoretical Mathematics."
schema:about
schema:about
schema:contributor
rdf:typeschema:Organization
schema:name"STANFORD UNIV CALIF DEPT OF COMPUTER SCIENCE."
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."
schema:exampleOfWork<http://worldcat.org/entity/work/id/23397965>
schema:inLanguage"en"
schema:name"A Fast Algorithm for finding Dominators in a Flow Graph."
schema:numberOfPages"42"
schema:publisher
rdf:typeschema:Organization
schema:name"Defense Technical Information Center"

Content-negotiable representations

关闭窗口

请登入WorldCat 

没有张号吗?很容易就可以 建立免费的账号.