Yayın:
Analyzing Shortest Path Problem via Single-Valued Triangular Neutrosophic Numbers: A Case Study

Sadeleştirilmiş öğe sayfası
dc.contributor.authorGözde Koca
dc.contributor.authorKARAMAŞA, ÇAĞLAR
dc.contributor.authorEzgi Demir
dc.contributor.authorÖzgür İcan
dc.contributor.authorÇağlar Karamaşa
dc.contributor.orcid0000-0001-6847-6812
dc.contributor.orcid0000-0002-7335-5094
dc.contributor.orcid0000-0002-6328-4018
dc.contributor.orcid0000-0003-2454-1824
dc.date.accessioned2025-11-13T12:04:03Z
dc.date.issued2021-01-01
dc.identifier.doihttps://doi.org/10.1007/978-3-030-57197-9_25
dc.identifier.openalexW3201236271
dc.identifier.urihttps://hdl.handle.net/11421/8852
dc.identifier.urihttps://doi.org/10.1007/978-3-030-57197-9_25
dc.language.isoen
dc.rightsrestrictedAccess
dc.subjectShortest path problem
dc.subjectK shortest path routing
dc.subjectLongest path problem
dc.subjectShortest Path Faster Algorithm
dc.subjectMathematics
dc.subjectPath (computing)
dc.subjectComputer science
dc.subjectYen's algorithm
dc.subjectFloyd–Warshall algorithm
dc.subjectCore (optical fiber)
dc.subjectMathematical optimization
dc.subjectGraph
dc.subjectAlgorithm
dc.subjectCombinatorics
dc.subjectDijkstra's algorithm
dc.subject.sdg10
dc.titleAnalyzing Shortest Path Problem via Single-Valued Triangular Neutrosophic Numbers: A Case Study
dc.typebook-chapter
dspace.entity.typePublication
local.authorid.openalexA5005317663

Dosyalar

Koleksiyonlar

Publications