Abstract
The authors provide distinct algorithms for computing transitive closure and transitive reduction with sequential time complexities of O(Σei) and O(n2 + Σei), respectively, and parallel time complexities of O(ei) and O(n + ei), respectively. The proposed transitive closure algorithms are favorable for the sparse digraphs. It is still open whether transitive reduction may be computed in O(Σei) (or O(ei) in parallel).
Original language | English (US) |
---|---|
Title of host publication | PARBASE 90 Int Conf Databases Parallel Archit Appl |
Editors | Naphtali Rishe, Shamkant B. Navathe, Doron Tal |
Publisher | Publ by IEEE |
Pages | 152-154 |
Number of pages | 3 |
State | Published - Jan 1 1990 |
Event | PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications - Miami Beach, FL, USA Duration: Mar 7 1990 → Mar 9 1990 |
Other
Other | PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications |
---|---|
City | Miami Beach, FL, USA |
Period | 3/7/90 → 3/9/90 |
ASJC Scopus subject areas
- Engineering(all)