graduation at Ciência da Computação from Pontifícia Universidade Católica do Rio Grande do Sul (2017). Has experience in Computer Science, focusing on Theory of Computing (Source: Lattes Curriculum)
| News published in Agência FAPESP Newsletter about the researcher |
| @ |
A graph G = (V,E) is connected if for every pair of vertices u and v in V there is a path from u to v in G; if there isn't, we say that G is disconnected. A graph is k-connected if it has more than k vertices and the removal of any k' < k vertices does not disconnect it.In 1963, Tutte showed that for every 3-connected graph G and any pair of vertices u,v in V(G) there is a path P from u t…
In this Master's Research Project, we propose the study of kernels and their generalization to k-kernels. We begin by presenting a survey of the current state of the field -- identifying the main results and open problems -- in order to deeply understand the concepts that will be studied and, therefore, easily achieve our goals. Kernels in digraphs were born from the game theory field and…
| 1 / 1 | Ongoing scholarships in Brazil |
| 1 / 1 | Completed scholarships in Brazil |
| 2 / 2 | All Scholarships |
| Associated processes | |
CV Lattes
ORCID