2026-10-29T23:51:49Zhttps://bayburt-rdlopen.rawdatalibrary.net/oai/request

oai:bayburt-rdlopen.rawdatalibrary.net:bayburt/123702026-10-29T19:42:26Zopenairedrivercom_bayburt_10000col_bayburt_10001com_bayburt_10007col_bayburt_10218

Shortest path problem under interval valued neutrosophic settingBroumi, SaidBakali, AssiaTalea, MohamedSmarandache, FlorentinKrishnan Kishore, K.P.Şahin, RıdvanInterval Valued Neutrosophic GraphScore FunctionShortest Path ProblemThis paper provides a research of the shortest neutrosophic path with interval valued neutrosophic numbers on a network. The suggested algorithm also provides the shortest path length utilizing ranking function from the source node to the destination node. Each of the arc lengths is attributed to an interval valued neutrosophic number. Lastly, we provide a numerical example to illustrate the suggested approach.World Academy of Research in Science and Engineering2019Articlehttps://rdlopen.rawdatalibrary.net/r/bayburt/12370https://doi.org/10.30534/ijatcse/2019/4081.120192278-3091enInternational Journal of Advanced Trends in Computer Science and Engineeringinfo:eu-repo/semantics/openAccessinfo:eu-repo/semantics/articlehttps://bayburt-rdlopen.rawdatalibrary.net/tr/items/bayburt/12370