한국지능시스템학회:학술대회논문집 (Proceedings of the Korean Institute of Intelligent Systems Conference)
- 한국퍼지및지능시스템학회 2001년도 추계학술대회 학술발표 논문집
- /
- Pages.314-318
- /
- 2001
타입-2 퍼지 가중치 그래프에서의 최단경로문제
Shortest Path Problem in a Type-2 Fuzzy Weighted Graph
- Lee, Seungsoo (Department of EECS, Division of Computer Science, KAIST) ;
- Lee, Kwang H. (Department of EECS, Division of Computer Science, KAIST)
- 발행 : 2001.12.01
초록
Constructing a shortest path on a graph is a fundamental problem in the area of graph theory. In an application where we cannot exactly determine the weights of edges, fuzzy weights can be used instead of crisp weights, and Type-2 fuzzy weights will be more suitable if this uncertainty varies under some conditions. In this paper, shortest path problem in type-1 fuzzy weighted graphs is extended for type-2 fuzzy weighted graphes. A solution is also given based on possibility theory and extension principle.