Bellman-Ford algorithm for solving shortest path problem of a network under picture fuzzy environment

dc.contributor.author	Parimala, Mani
dc.contributor.author	Broumi, Said
dc.contributor.author	Prakash, Karthikeyan
dc.contributor.author	Topal, Selcuk
dc.date.accessioned	2021-12-16T09:06:42Z
dc.date.available	2021-12-16T09:06:42Z
dc.date.issued	2021
dc.identifier.issn	2199-4536
dc.identifier.uri	https://doi.org/10.1007/s40747-021-00430-w
dc.identifier.uri	http://dspace.beu.edu.tr:8080/xmlui/handle/20.500.12643/9844
dc.description.abstract	An elongation of the novel intuitionistic fuzzy set is a picture fuzzy set theory. The demonstration of this has been used to deal with the abstinence criteria in a decision-making problem. The uncertainty in nature occurs sometimes in real-world problems
dc.language.iso	English
dc.publisher	Sprınger Heıdelberg
dc.rights	gold
dc.source	Complex & Intellıgent Systems
dc.title	Bellman-Ford algorithm for solving shortest path problem of a network under picture fuzzy environment
dc.type	Article
dc.identifier.issue	5
dc.identifier.startpage	2373
dc.identifier.endpage	2381
dc.identifier.doi	10.1007/s40747-021-00430-w
dc.identifier.wos	WOS:000661024000001
dc.identifier.volume	7

Files in this item

Files	Size	Format	View
There are no files associated with this item.