Shortest paths in fuzzy weighted graphs
โ
Chris Cornelis; Peter De Kesel; Etienne E. Kerre
๐
Article
๐
2004
๐
John Wiley and Sons
๐
English
โ 232 KB
The task of finding shortest paths in weighted graphs is one of the archetypical problems encountered in the domain of combinatorial optimization and has been studied intensively over the past five decades. More recently, fuzzy weighted graphs, along with generalizations of algorithms for finding op