A theoretical and computational approach for the community detection problem
Multi-level Multi-source visual analysis of government text data
A theoretical and computational approach for the community detection problem in ne...
| Grant number: | 15/11930-4 |
| Support Opportunities: | Scholarships abroad - Research Internship - Doctorate |
| Effective date (Start): | September 01, 2015 |
| Effective date (End): | August 31, 2016 |
| Field of knowledge: | Physical Sciences and Mathematics - Computer Science - Theory of Computation |
| Principal Investigator: | Yoshiko Wakabayashi |
| Grantee: | Phablo Fernando Soares Moura |
| Supervisor: | Stephan Thomasse |
| Host Institution: | Instituto de Matemática e Estatística (IME). Universidade de São Paulo (USP). São Paulo , SP, Brazil |
| Research place: | École Normale Supérieure, Lyon (ENS), France |
| Associated to the scholarship: | 13/19179-0 - Optimization problems on graph partitioning, BP.DR |
Abstract The focus of this research proposal is the study of partition problems on graphs.We are particularly interested in the proper orientation, path cover, and convex recoloring problems. In the first problem, we have to orient every edge in a graph so that the indegrees of the vertices in this orientation induce a partition of the set of vertices into a minimum number of stable sets.In the second problem, we are interested in finding a partition of the set of vertices of a graph into a minimum number of paths. Finally, in the convex recoloring problem, we have to partition the set of vertices in such a way that each element of this partition induces a connected subgraph of the input graph. (AU) | |
| News published in Agência FAPESP Newsletter about the scholarship: | |
| More itemsLess items | |
| TITULO | |
| Articles published in other media outlets ( ): | |
| More itemsLess items | |
| VEICULO: TITULO (DATA) | |
| VEICULO: TITULO (DATA) | |