Abstract
Goldberg poses the question of whether his MDD (maximum-distance discharge) algorithm for Maximum Flow can run in O(n 2 log n( m p )) time using p = O( m ) processors and a linear amount of memory. Two data structures he considers, the dynamic array and the parallel 2–3 tree, yield slightly superlinear space bounds. We present a simple data structure that supports the required operations, adheres to the required time bounds, and uses an optimal (linear) amount of space in the EREW PRAM model of computation, answering Goldberg's question in the affirmative. We call our structure the Parallel Cardinality Stack (PCS). The operations supported by this structure may have applications in other parallel algorithms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
