Finding the shortest path between all pairs of nodes in circular sparse networks by decomposition algorithm
(주)코리아스칼라
- 최초 등록일
- 2023.04.05
- 최종 저작일
- 2002.10
- 8페이지/ 어도비 PDF
- 가격 4,000원
* 본 문서는 배포용으로 복사 및 편집이 불가합니다.
서지정보
ㆍ발행기관 : 한국산업경영시스템학회
ㆍ수록지정보 : 한국산업경영시스템학회 학술대회
ㆍ저자명 : Kim Jun Hong
목차
Abstract
1. Introduction
2. Decomposition algorithms for finding all shortest distances in donut shaped sparse networks
3. Conclusion
references
영어 초록
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.
참고 자료
없음
"한국산업경영시스템학회 학술대회"의 다른 논문
더보기 (5/10)