A parallel algorithm for finidng an st-shortest path in outerplanar graphs

A parallel algorithm for finidng an st-shortest path in outerplanar graphs

0.00 Avg rating—0 Votes
Article ID: iaor19962207
Country: Japan
Volume: J78-D-I
Issue: 11
Start Page Number: 867
End Page Number: 877
Publication Date: Nov 1995
Journal: Transactions of the Institute of Electronics, Information and Communication Engineers
Authors: ,
Keywords: networks, optimization, computational analysis: parallel computers
Abstract:

The st-shortest path problem of obtaining the shortest simple path between two given vertices s and t on an outerplanar graph G is considered, where nonnegative weight d(e) is assigned on each edge in G. The authors propose an O(logn) time parallel algorithm using O(nloglogn/logn) processors over CRCW PRAM. [In Japanese.]

Reviews

Required fields are marked *. Your email address will not be published.