Has a bachelor's degree in molecular science from Univeristy of São Paulo (2021). Master's student at the Department of Computer Science at IME-USP under the supervision of Professor Dr. Marcel Kenji de Carli Silva. Participates in academic olympiads in ACM-ICPC style as a member of the extension group MaratonUSP. Has interest in Optimization and Algorithms. (Source: Lattes Curriculum)
| News published in Agência FAPESP Newsletter about the researcher |
| TITULO |
| Articles published in other media outlets (0 total): |
| More itemsLess items |
| VEICULO: TITULO (DATA) |
| VEICULO: TITULO (DATA) |
In the area of combinatory and graph theory, a known problem is the shortest path problem, this means, given a graph G and two vertices of it find the shortest path between them. In mathematical notation, the problem can be described as given a graph G = (V, E) and two vertices s, t of V and a function cost from the edges to the integers, we want to find the set S of edges that goes from …
| 1 / 1 | Completed scholarships in Brazil |
| Associated processes | |
CV Lattes
ORCID