An Algorithm for Extracting Intuitionistic Fuzzy Shortest Path in a Graph

Wu, B. S. (2020). Quantum Approximate Optimization Algorithm for Maximum Independent Set Problem in 3-regular Graph [master's thesis, National Tsing Hua University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0016-2502202114234773
Pan, T. J. (2004). A Novel Sum-Product Algorithm on Factor Graphs [master's thesis, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU.2004.00876
徐偉軒（2014）。A new algorithm for dynamic shortest path problem in large network〔碩士論文，國立臺中科技大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0061-2008201413413400
Jayagowri, P., & Ramani, G. G. (2014). Using Trapezoidal Intuitionistic Fuzzy Number to Find Optimized Path in a Network. Advances in Fuzzy Systems, (2014), 151-156. https://doi.org/10.1155/2014/183607
Yu, C. Y. (2002). An efficient fault-containing self-stabilizing algorithm for the shortest path problem in a distributed system [master's thesis, Yuan Ze University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0009-0112200611345617