Yayın:
SHORTEST PATH ALGORITHMS FOR PETRI NETS

Sadeleştirilmiş öğe sayfası
dc.contributor.authorÖzkan, Hanife Apaydın
dc.contributor.orcid0000-0003-2932-0166
dc.date.accessioned2025-11-13T22:21:24Z
dc.date.issued2016-09-23
dc.identifier.endpage2079
dc.identifier.issue2
dc.identifier.openalexW2560293215
dc.identifier.startpage2073
dc.identifier.urihttps://hdl.handle.net/11421/13911
dc.identifier.urihttps://dergipark.org.tr/tr/download/article-file/226122
dc.identifier.volume16
dc.language.isoen
dc.relation.ispartofIU-Journal of Electrical & Electronics Engineering
dc.rightsrestrictedAccess
dc.subjectPetri net
dc.subjectReachability
dc.subjectShortest path problem
dc.subjectComputer science
dc.subjectAlgorithm
dc.subjectK shortest path routing
dc.subjectState (computer science)
dc.subjectPath (computing)
dc.subjectStochastic Petri net
dc.subjectTree (set theory)
dc.subjectGraph
dc.subjectTheoretical computer science
dc.subjectMathematics
dc.titleSHORTEST PATH ALGORITHMS FOR PETRI NETS
dc.typeArticle
dspace.entity.typePublication
local.authorid.openalexA5011581728

Dosyalar

Koleksiyonlar

Publications