| |
|
Description: |
A network/graph provides an abstract representation, establishing the relationships among a set of elements. It helps organizing the information and provides an overall view of the underlying system.
These structures are being used in a large number of areas and scientific domains, namely in Sociology, Financial Markets, Marketing, Engineering, Chemistry, Biology, among others, contributing for knowledge progress and deeper understanding of hidden underlying information.
A clique is a complete subgraph, revealing a strongly related group of nodes (elements). More recent concepts of cliques involve distance relaxations (k-cliques, k-clubes), degree relaxations (k-plexes) and clique's neighborhood (cut-cliques).
In this seminar, we discuss formulations for maximum clique and maximum cut-clique problems, exploring new discretized models. We also discuss their applicability on some real-world environments, namely on biological networks, press networks and in market basket analysis. Among the biological networks discussed, we consider protein-protein interaction networks, networks of interacting pathways and gene co-expression networks.
|
|
Date: |
|
|
Speaker: |
Pedro Coimbra (ISCAC, Polytechnic Institute of Coimbra)
|
|
Institution: |
ISCAC, Polytechnic Institute of Coimbra
|
| Research Groups: |
-Numerical Analysis and Optimization
|
|
See more:
|
<Main>
|
|
