Browse > Article

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

Jun-Hong Kim (Dept. of Industrial Engineering, University of Suwon)
Young-Bae Chung (Dept. of Industrial Engineering, University of Incheon)
Publication Information
Journal of Korean Society of Industrial and Systems Engineering / v.26, no.1, 2003 , pp. 47-53 More about this Journal
Keywords
circular sparse network; shortest distance; doughnut shaped network; decomposition algorithm; n-degree circular sparse network;
Citations & Related Records
연도 인용수 순위
  • Reference
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 Hoffman, AJ, Winograd S.; 'Finding all shortest distances in directed network', IBM J.Res.Develop., 16(4), pp.412-414, 1972
3 Shier,D.R.; 'A decomposition algorithm for optimality problems in tree-structured networks', Discrete math., 6(3), pp.175-189, 1973
4 Zheng SQ; Maximum independent sets of circular arc graphs -simplified algorithm and proofs', Networks, 28(1), pp. 15-19, 1996
5 Blewett,W.J., Hu,T.C.; 'Tree decomposition algorithm for large networks', Networks, 7(.4), pp.289-296, 1977
6 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
7 Rescigno AA; 'Optimally balanced spanning tree of the star network, IEEE Transactions on Computers, 55(1), pp.88-91, 2001
8 Deo,N., Pang,C.; 'Shortest path algorithm : Taxonomy and annotation', Networks, 14, pp.275-323, 1984
9 Tabourier,Y.;'AII shortest distance ina graph. An improvement to Danzig's inductive algorithm', Discrete math. 4(1), pp.83-87, 1973
10 Bazaraa,M., Jarvis, J.J.; 'Linear programming and Network flows', John Wiley and Sons, New York, 1990
11 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
12 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
13 Gobow,H.N.; 'Scaling algorithms for network problems', Journal of Computer System Science, 31, pp.148-168, 1985
14 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
15 Saltzer JH, Pogran KT; 'A star shaped ring network with high maintainability', Computer networks, 4(5), pp.239-244, 1980
16 김준홍; 'Non-circular sparse network을 위한 분할앨고리즘', 수원대, 11, 1996