Hammock-on-Ears Decomposition: A Technique for the Efficient Parallel Solution of Shortest Paths and Other Problems
نویسندگان
چکیده
We show how to decompose efficiently in parallel any graph into a number, γ̃, of outerplanar subgraphs (called hammocks) satisfying certain separator properties. We achieve this decomposition in O(log n log log n) time using O(n + m) CREW PRAM processors, for an n-vertex, m-edge graph. This decomposition provides a general framework for solving graph problems efficiently in parallel. Its value is demonstrated by using it to improve previous bounds for shortest paths and related problems in the class of sparse graphs (which includes planar and bounded genus graphs).
منابع مشابه
Hammock on Ears Decomposition A Technique for the E cient Parallel Solution of Shortest Paths and Other Problems
We show how to decompose e ciently in parallel any graph into a number of outerplanar subgraphs called hammocks satisfying certain separator properties Our work combines and extends the sequential hammock decomposition technique intro duced by G Frederickson and the parallel ear decomposition technique thus we call it the hammock on ears decomposition We mention that hammock on ears decomposi...
متن کاملEfficient Parallel Algorithms for Shortest Paths in Planar Graphs
Efficient parallel algorithms are presented, on the CREW PRAM model, for generating a succinct encoding of all pairs shortest path information in a directed planar graph G with real-valued edge costs but no negative cycles. We assume that a planar embedding of G is given, togetber with a set of q faces that cover all the vertices. Then our algorithm runs in O(log 2 n) time and employs O{nq + M(...
متن کاملHammock - on - Ears Decomposition : A Techniquefor
We show how to decompose e ciently in parallel any graph into a number, ~ , of outerplanar subgraphs (called hammocks) satisfying certain separator properties. Our work combines and extends the sequential hammock decomposition technique introduced by G. Frederickson and the parallel ear decomposition technique, thus we call it the hammock-on-ears decomposition. We mention that hammock-on-ears d...
متن کاملHammock - on - Ears Decomposition : A Technique for the E cient Parallel
We show how to decompose e ciently in parallel any graph into a number, ~ , of outerplanar subgraphs (called hammocks) satisfying certain separator properties. Our work combines and extends the sequential hammock decomposition technique introduced by Frederickson and the parallel ear decomposition technique, thus we call it the hammock-on-ears decomposition. We mention that hammock-on-ears deco...
متن کاملA fixed and flexible maintenance operations planning optimization in a parallel batch machines manufacturing system
Scheduling has become an attractive area for artificial intelligence researchers. On other hand, in today's real-world manufacturing systems, the importance of an efficient maintenance schedule program cannot be ignored because it plays an important role in the success of manufacturing facilities. A maintenance program may be considered as the heath care of manufacturing machines and equipments...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994