| dc.contributor.author | Jordan, C. | |
| dc.contributor.author | Murillo Arcila, Marina | |
| dc.contributor.author | Torregrosa, Juan R. | |
| dc.contributor.other | Matemáticas | es_ES |
| dc.date.accessioned | 2025-02-27T08:45:10Z | |
| dc.date.available | 2025-02-27T08:45:10Z | |
| dc.date.issued | 2021 | |
| dc.identifier.issn | 2227-7390 | |
| dc.identifier.uri | http://hdl.handle.net/10498/35663 | |
| dc.description.abstract | In this paper, we highlight that Graph Theory is certainly well suited to an applications
approach. One of the basic problems that this theory solves is finding the shortest path between
two points. For this purpose, we propose two real-world problems aimed at STEM undergraduate
students to be solved by using shortest path algorithms from Graph Theory after previous modeling. | es_ES |
| dc.format | application/pdf | es_ES |
| dc.language.iso | eng | es_ES |
| dc.publisher | MDPI | es_ES |
| dc.source | Mathematics, 9(23):3110, 2021 | es_ES |
| dc.subject | weighted graphs | es_ES |
| dc.subject | shortest path algorithms | es_ES |
| dc.subject | Dijkstra | es_ES |
| dc.subject | Bellman–Ford | es_ES |
| dc.subject | modeling | es_ES |
| dc.subject | STEM | es_ES |
| dc.title | The STEM methodology and graph theory. Some practical examples | es_ES |
| dc.type | journal article | es_ES |
| dc.rights.accessRights | open access | es_ES |
| dc.identifier.doi | 10.3390/MATH9233110 | |
| dc.type.hasVersion | VoR | es_ES |