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

A near-optimal parallel algorithm for edge-coloring outerplanar 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

2 Author(s)
Caspi, Y. ; Comput. Sci. Program, Texas Univ., Dallas, Richardson, TX, USA ; Dekel, E.

The article presents a parallel EREW PRAM algorithm that runs in O(log2n) time using n/logn processors to optimally color the edges of an outerplanar graph. The algorithm improves the best known algorithm in both time, and number of processors. This more efficient algorithm is a result of a new approach for solving the problem. Also presented is a parallel EREW PRAM algorithm that runs in O(logn) using n/logn processors for finding a maximal matching in outerplanar graphs

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.