Skip to Main Content
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 Xplore subscriptions
We show that articulation points and bridges of permutation graphs can be found in O(logn) time using O(n/logn) processors on an EREW PRAM. The algorithms are optimal with respect to the time-processor product.
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.© Copyright 2015 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.