Constrained partitions in graphs: bio and financial applications
 
 
Description:  This seminar addresses partition problems in graphs, from an applied perspective. We discuss results and formulations, ranging from very restrictive partition components (partition into cliques) to less restrictive ones (partition into trees - a forest). We also compare these results with some standard clustering techniques, particularly within non-hierarchical clustering.
To promote the discussion we start using an abstract example and then move into real-world applications, considering biological networks and financial networks.
Date:  2017-02-15
Start Time:   14:30
Speaker:  Pedro Martins (IPCoimbra and CMAF-CIO)
Institution:  ISCAC - Polytechnic Institute of Coimbra
Research Groups: -Numerical Analysis and Optimization
See more:   <Main>   <Lab for Computational Mathematics>  
 
© Centre for Mathematics, University of Coimbra, funded by
Science and Technology Foundation
Powered by: rdOnWeb v1.4 | technical support