About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
IPPS 1993
Conference paper
Parallel dynamic st-numbering and applications
Abstract
Given an arbitrary st-numbering of a biconnected graph of n vertices and m edges, parallel algorithms for dynamically finding another st-numbering of any specified pair of vertices on EREW P-RAM are presented. The algorithms run in O(log n) time using m/logn processors on EREW P-RAM. The dynamic st-numbering is applied to some network problems such as bipartition, centroid trees and centered trees construction.