Cart (Loading....) | Create Account
Close category search window
 

Efficient parallel shortest path algorithms for k-chordal graphs

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

1 Author(s)
Mitra, P. ; Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC, Canada

Presents parallel NC algorithms for all pair shortest path problem with optimal processor time product and single source shortest path problem with near optimal processor time product in k-chordal graphs. The algorithm for all pair problem runs in O(log2 n) time with O(n2/log2 n) processors. The single source problem runs with O( n) processors in O(log2 n) time. In both cases the author assumes CRCW PRAM model of computation

Published in:

Parallel Processing Symposium, 1992. Proceedings., Sixth International

Date of Conference:

23-26 Mar 1992

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 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.