Journal of Korean Society of Industrial and Systems Engineering (산업경영시스템학회지)

Society of Korea Industrial and System Engineering (한국산업경영시스템학회)
권호 표지

Finding the shortest distance between all pairs of nodes in circular sparse networks by decomposition algorithm

Circular sparse network에서 분할법을 이용한 최단거리 결정

  • Jun-Hong Kim (Dept. of Industrial Engineering, University of Suwon) ;
  • Young-Bae Chung (Dept. of Industrial Engineering, University of Incheon)
  • Published : 2003.03.01
Download PDF
⟨ Previous Next ⟩

Abstract

이 논문은 환(環)을 형성하는 부분네트웍들로 이루어진 sparse network의 특수한 형태에서 최단거리 결정을 위한 효율적인 앨고리즘을 제안한다. 제시된 앨고리즘은 소위 비환(非換) 형태의 sparse network에 대한 최단거리 결정 앨고리즘의 확장이라 할 수 있다. 도우넛 형태를 갖는 sparse network에 대해 최단거리 결정을 위한 접근법으로 하나는 정점제거 방법이고, 다른 하나는 선분제거 방법이다. 여기서 제안된 앨고리즘은 일반적인 n-degree circular sparse network으로 확대될 수 있다.

Keywords

References

  1. Ahuja,R.K.K., Orlin,M,J.B., Tarjan,R.E.T.; 'Faster algorithms for the shortest path problem', Technical report No.193, Oper. Rcs. Center, M.I.T., Cambridge, MA. 1988
  2. Atallah MJ, Chen DZ Lee DT; 'An algorithm for shortest paths on weighted interval and circular arc graphs with applications', Algorithmica, 14(5), pp.429-441, 1995
  3. Bazaraa,M., Jarvis, J.J.; 'Linear programming and Network flows', John Wiley and Sons, New York, 1990
  4. Blewett,W.J., Hu,T.C.; 'Tree decomposition algorithm for large networks', Networks, 7(.4), pp.289-296, 1977
  5. Chen CC, Chen J; 'Nearly optimal one to many routing in star networks, IEEE Transactions on Parallel and distributed systems, 8(12), pp.1196-1202, 1997
  6. Chen DZ, Lee DT, Sridhar R., Sekharan CN; 'Solving the all-pair shortest path query problem on interval and circular arc graphs', Networks, 31(4), pp.249-258. 1998
  7. Deo,N., Pang,C.; 'Shortest path algorithm : Taxonomy and annotation', Networks, 14, pp.275-323, 1984
  8. Gobow,H.N.; 'Scaling algorithms for network problems', Journal of Computer System Science, 31, pp.148-168, 1985
  9. Hoffman, AJ, Winograd S.; 'Finding all shortest distances in directed network', IBM J.Res.Develop., 16(4), pp.412-414, 1972
  10. Manacher GK, Mankus TA; 'A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone', Networks, 39(2), pp.68-72, 2002
  11. Rescigno AA; 'Optimally balanced spanning tree of the star network, IEEE Transactions on Computers, 55(1), pp.88-91, 2001
  12. Saltzer JH, Pogran KT; 'A star shaped ring network with high maintainability', Computer networks, 4(5), pp.239-244, 1980
  13. Shier,D.R.; 'A decomposition algorithm for optimality problems in tree-structured networks', Discrete math., 6(3), pp.175-189, 1973
  14. Tabourier,Y.;'AII shortest distance ina graph. An improvement to Danzig's inductive algorithm', Discrete math. 4(1), pp.83-87, 1973
  15. Zheng SQ; Maximum independent sets of circular arc graphs -simplified algorithm and proofs', Networks, 28(1), pp. 15-19, 1996
  16. 김준홍; 'Non-circular sparse network을 위한 분할앨고리즘', 수원대, 11, 1996