A computational logic approach for finding maximum-size cliques in large-scale networks (Mathematical Logic)

JOÃO MARQUES SILVA (FACULDADE DE CIÊNCIAS, 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.

Room 6.2.33 [⤴]