Por Bogdan Dicher (Centro de Filosofia, Universidade de Lisboa).

Abstract: Graph optimization problems find important applications in the analysis of large-scale networks. One representative example is the computation of maximum-size complete subgraphs.

This talk details a computational logic approach for computing maximum-size complete subgraphs, which is not only efficient in practice, but also scales for large-scale networks.

This seminar is supported by National Funding from FCT - Fundação para a Ciência e a Tecnologia, under the project: UID/MAT/04561/2013