An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs

2005 ◽  
Vol 17 (1-2) ◽  
pp. 1-23 ◽  
Author(s):  
Anita Saha ◽  
Madhumangal Pal ◽  
Tapan K. Pal
2017 ◽  
Vol 28 (01) ◽  
pp. 39-60
Author(s):  
Frank Gurski ◽  
Patrick Gwydion Poullie

Interval routing is a space efficient method to realize a distributed routing function. In this paper we show that every circular-arc graph allows a shortest path strict 2-interval routing scheme, i.e., by introducing a global order on the vertices and assigning at most two (strict) intervals in this order to the ends of every edge allows to depict a routing function that implies exclusively shortest paths. Since circular-arc graphs do not allow shortest path 1-interval routing schemes in general, the result implies that the class of circular-arc graphs has strict compactness 2, which was a hitherto open question. Additionally, we show that the constructed 2-interval routing scheme is a 1-interval routing scheme with at most one additional interval assigned at each vertex and we outline an algorithm to calculate the routing scheme for circular-arc graphs in 𝒪(n2) time, where n is the number of vertices.


2018 ◽  
Vol 35 (1) ◽  
pp. 739-748 ◽  
Author(s):  
Sk. Amanathulla ◽  
Madhumangal Pal

1981 ◽  
Vol 2 (2) ◽  
pp. 88-93 ◽  
Author(s):  
James B. Orlin ◽  
Maurizio A. Bonuccelli ◽  
Daniel P. Bovet

Sign in / Sign up

Export Citation Format

Share Document