An implementation of the Dilkstra algorithm for fuzzy costs (Technical report 2018)

dc.centroE.T.S.I. Telecomunicaciónen_US
dc.contributor.authorValdes Valdes, Lissette
dc.contributor.authorAriza-Quintana, Alfonso
dc.contributor.authorAlonso, Sira
dc.contributor.authorJoya-Caparrós, Gonzalo
dc.date.accessioned2019-04-04T07:50:07Z
dc.date.available2019-04-04T07:50:07Z
dc.date.created2018
dc.date.issued2019-04-04
dc.departamentoTecnología Electrónica
dc.description.abstractThis report presents an implementation the Dijkstra algorithm applied to a type V fuzz graph. This new algorithm can find the shortest path in a graph with edge costs are defined as positive triangular fuzzy numbersen_US
dc.identifier.urihttps://hdl.handle.net/10630/17478
dc.language.isoengen_US
dc.relation.eventdate2018en_US
dc.rights.accessRightsopen accessen_US
dc.subjectAlgoritmos computacionalesen_US
dc.subjectAlgoritmo de Dijkstraen_US
dc.subject.otherDijkstraen_US
dc.subject.otherFuzzy numbersen_US
dc.subject.otherType V fuzzy graphen_US
dc.subject.otherRoutingen_US
dc.titleAn implementation of the Dilkstra algorithm for fuzzy costs (Technical report 2018)en_US
dc.typereportes_ES
dspace.entity.typePublication
relation.isAuthorOfPublicationc73a17df-e826-4a2c-a13c-7ddc2cf6374e
relation.isAuthorOfPublication39cdaa1a-9f58-44de-a638-781ee086cd05
relation.isAuthorOfPublication.latestForDiscoveryc73a17df-e826-4a2c-a13c-7ddc2cf6374e

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Fuzzy_Dijkstra_algorithm.pdf
Size:
223.59 KB
Format:
Adobe Portable Document Format
Description:
Technical report
Download

Description: Technical report

Collections