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

• 영문명: Finding the shortest path between all pairs of nodes in circular sparse networks by decomposition algorithm
• 발행기관: 한국산업경영시스템학회
• 저자명: Kim Jun Hong
• 간행물 정보: 『한국산업경영시스템학회 학술대회』2002년 추계국제학술대회, 388~395쪽, 전체 8쪽
• 주제분류: 공학 > 산업공학
• 파일형태: PDF
• 발행일자: 2002.10.01

영문 초록

  We give efficient algorithms for finding shortest distances in special types of sparse network where the networks are composed of series of subnetworks which form circles. The algorithms presented in this paper are so called extensions of the non-circular sparse network algorithms The suggested algorithm is composed of two approach parts for only donut shaped sparse network, the one is the node elimination approach and the other the arc elimination approach, Our algorithms for finding all shortest distances can be extended in general circular sparse networks.

목차

Abstract
1. Introduction
2. Decomposition algorithms for finding all shortest distances in donut shaped sparse networks
3. Conclusion
references