Mostrar el registro sencillo del ítem
An implementation of the Dilkstra algorithm for fuzzy costs (Technical report 2018)
dc.contributor.author | Valdés, Lissette | |
dc.contributor.author | Ariza-Quintana, Alfonso | |
dc.contributor.author | Alonso, Sira | |
dc.contributor.author | Joya-Caparrós, Gonzalo | |
dc.date.accessioned | 2019-04-04T07:50:07Z | |
dc.date.available | 2019-04-04T07:50:07Z | |
dc.date.created | 2018 | |
dc.date.issued | 2019-04-04 | |
dc.identifier.uri | https://hdl.handle.net/10630/17478 | |
dc.description.abstract | This 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 numbers | en_US |
dc.language.iso | eng | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.subject | Algoritmos computacionales | en_US |
dc.subject | Algoritmo de Dijkstra | en_US |
dc.subject.other | Dijkstra | en_US |
dc.subject.other | Fuzzy numbers | en_US |
dc.subject.other | Type V fuzzy graph | en_US |
dc.subject.other | Routing | en_US |
dc.title | An implementation of the Dilkstra algorithm for fuzzy costs (Technical report 2018) | en_US |
dc.type | info:eu-repo/semantics/report | en_US |
dc.centro | E.T.S.I. Telecomunicación | en_US |
dc.relation.eventdate | 2018 | en_US |