A New, Simpler Linear-Time Dominators Algorithm (1998)
Cached
Download Links
- [www.math.tau.ac.il]
- [www.research.att.com]
- [www.research.att.com]
- DBLP
Other Repositories/Bibliography
| Venue: | ACM Transactions on Programming Languages and Systems |
| Citations: | 14 - 4 self |
BibTeX
@ARTICLE{Buchsbaum98anew,,
author = {Adam L. Buchsbaum and Haim Kaplan and Anne Rogers and Jeffery R. Westbrook},
title = {A New, Simpler Linear-Time Dominators Algorithm},
journal = {ACM Transactions on Programming Languages and Systems},
year = {1998},
volume = {20},
pages = {1265--1296}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
this article is organized as follows. Section 2 outlines Lengauer and Tarjan's approach. Section 3 gives a broad overview of our algorithm and dierentiates it from previous work. Section 4 presents our algorithm in detail, and Section 5 analyzes its running time. Section 6 presents our new path-compression result, on which the analysis relies. Section 7 describes our implementation, and Section 8 reports experimental results. We conclude in Section 9
