A parallel algorithm to construct a dominance graph on nonoverlapping rectangles
Journal Article
·
· International Journal of Parallel Programming; (United States)
- Univ. of Alabama, Birmingham, AL (United States)
A parallel algorithm to generate the dominance graph on a collection of nonoverlapping iso-oriented rectangles is presented. This graph arises from the constraint graph expresses the notion of aboveness' on a collection of nonoverlapping rectangles: it is the directed graph which contains an edge from a rectangle b to rectangle c iff c is immediately above b. The algorithm is based on the divide and conquer paradigm; in the EREW PRAM model, it has time complexity O(log[sup 2]n), using n/log n processors. Its processor-time product is O(n log n), which is optimal.
- OSTI ID:
- 7067425
- Journal Information:
- International Journal of Parallel Programming; (United States), Journal Name: International Journal of Parallel Programming; (United States) Vol. 21:4; ISSN IJPPE5; ISSN 0885-7458
- Country of Publication:
- United States
- Language:
- English
Similar Records
A nearly optimal parallel algorithm for constructing depth first spanning trees in planar graphs
High-probability parallel transitive-closure algorithms
Parallel (delta + 1) coloring of constant-degree graphs
Journal Article
·
Wed Jun 01 00:00:00 EDT 1988
· SIAM J. Comput.; (United States)
·
OSTI ID:6930310
High-probability parallel transitive-closure algorithms
Journal Article
·
Thu Jan 31 23:00:00 EST 1991
· SIAM Journal on Computing (Society for Industrial and Applied Mathematics); (United States)
·
OSTI ID:5926155
Parallel (delta + 1) coloring of constant-degree graphs
Technical Report
·
Sun Nov 30 23:00:00 EST 1986
·
OSTI ID:6677570