IEEE.org| IEEE Xplore Digital Library| IEEE Standards| IEEE Spectrum| More Sites

Cart (Loading....) | Create Account | 

Close category search window
Author Searchbeta |  Advanced Search  |  Preferences |  Search Tips  |  More Search Options  
 
Browse Conference Publications > Databases, Parallel Architect ... Help

Parallel transitive closure and transitive reduction algorithms

Full Text Sign-In or Purchase

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing! close button
puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Chang, P. ; Rockwell Int. Corp., Downers Grove, IL, USA ; Henschen, L.J.

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(Σe i) (or O(ei) in parallel)

Published in:
Databases, Parallel Architectures and Their Applications,. PARBASE-90, International Conference on

Date of Conference: 7-9 Mar 1990

Page(s):
152 - 154
Meeting Date :
07 Mar 1990-09 Mar 1990
Print ISBN:
0-8186-2035-8
INSPEC Accession Number:
3707166
Conference Location :
Miami Beach, FL
Digital Object Identifier :
10.1109/PARBSE.1990.77136
Product Type:
Conference Publications

IEEE Account

Purchase Details

Profile Information

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.